java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:33:55,510 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:33:55,512 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:33:55,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:33:55,524 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:33:55,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:33:55,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:33:55,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:33:55,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:33:55,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:33:55,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:33:55,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:33:55,533 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:33:55,534 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:33:55,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:33:55,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:33:55,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:33:55,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:33:55,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:33:55,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:33:55,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:33:55,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:33:55,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:33:55,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:33:55,549 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:33:55,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:33:55,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:33:55,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:33:55,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:33:55,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:33:55,562 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:33:55,563 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:33:55,563 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:33:55,563 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:33:55,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:33:55,567 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:33:55,567 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:33:55,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:33:55,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:33:55,593 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:33:55,593 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:33:55,593 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:33:55,593 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:33:55,594 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:33:55,594 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:33:55,594 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:33:55,594 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:33:55,594 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:33:55,595 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:33:55,596 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:33:55,596 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:33:55,597 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:33:55,597 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:33:55,597 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:33:55,597 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:33:55,597 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:33:55,600 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:33:55,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:33:55,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:33:55,600 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:33:55,600 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:33:55,600 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:33:55,601 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:33:55,601 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:33:55,601 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:33:55,601 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:33:55,602 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:33:55,602 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:33:55,602 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:33:55,602 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:33:55,602 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:33:55,602 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:33:55,604 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:33:55,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:33:55,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:33:55,604 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:33:55,605 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:33:55,651 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:33:55,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:33:55,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:33:55,675 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:33:55,676 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:33:55,676 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-12-03 18:33:55,677 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-12-03 18:33:55,714 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:33:55,716 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:33:55,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:33:55,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:33:55,717 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:33:55,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,750 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:33:55,750 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:33:55,750 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:33:55,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:33:55,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:33:55,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:33:55,754 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:33:55,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... [2018-12-03 18:33:55,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:33:55,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:33:55,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:33:55,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:33:55,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:33:55,855 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 18:33:55,855 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 18:33:55,855 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 18:33:56,067 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:33:56,067 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 18:33:56,068 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:33:56 BoogieIcfgContainer [2018-12-03 18:33:56,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:33:56,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:33:56,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:33:56,072 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:33:56,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:33:55" (1/2) ... [2018-12-03 18:33:56,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a0d750 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:33:56, skipping insertion in model container [2018-12-03 18:33:56,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:33:56" (2/2) ... [2018-12-03 18:33:56,076 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-12-03 18:33:56,086 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:33:56,093 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:33:56,111 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:33:56,146 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:33:56,146 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:33:56,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:33:56,147 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:33:56,147 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:33:56,147 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:33:56,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:33:56,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:33:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:33:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:33:56,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:56,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:33:56,173 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:56,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-03 18:33:56,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:56,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:56,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:56,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:56,752 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-12-03 18:33:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:33:56,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:33:56,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:33:56,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:33:56,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:33:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:33:56,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:33:56,842 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-12-03 18:33:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:33:56,932 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:33:56,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:33:56,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-03 18:33:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:33:56,946 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:33:56,946 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:33:56,950 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 [2018-12-03 18:33:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:33:56,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 18:33:56,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:33:56,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:33:56,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-03 18:33:56,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:33:56,989 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:33:56,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:33:56,990 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:33:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:33:56,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:33:56,990 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:33:56,991 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:33:56,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:33:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-03 18:33:56,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:33:56,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:56,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:33:56,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:33:56,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:33:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:33:57,206 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:33:57,504 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-03 18:33:57,705 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 18:33:57,858 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-03 18:33:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:33:57,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:33:57,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:33:57,862 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 18:33:57,864 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-03 18:33:57,925 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:33:57,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:34:00,224 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:34:00,225 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 21 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:34:00,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:00,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:34:00,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:00,260 INFO L192 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 [2018-12-03 18:34:00,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:00,274 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:00,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:00,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:00,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:00,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:00,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:00,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:00,603 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 [2018-12-03 18:34:00,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:00,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:00,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:00,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:00,992 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 18:34:00,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:01,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:01,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-03 18:34:01,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:01,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:34:01,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:34:01,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 18:34:01,019 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-12-03 18:34:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:01,089 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:34:01,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:34:01,090 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-03 18:34:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:01,091 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:34:01,091 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:34:01,092 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 [2018-12-03 18:34:01,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:34:01,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-03 18:34:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:34:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:34:01,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-03 18:34:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:01,095 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:34:01,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:34:01,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:34:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:34:01,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:01,096 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-03 18:34:01,096 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:01,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:01,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-03 18:34:01,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:01,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:01,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:01,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:01,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:01,351 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:34:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:01,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:01,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:01,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:01,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:01,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:01,651 INFO L192 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 [2018-12-03 18:34:01,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:34:01,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:34:01,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 18:34:01,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:01,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:01,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:01,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:01,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:01,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:01,857 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 [2018-12-03 18:34:01,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:01,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:01,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:01,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:02,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:02,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-03 18:34:02,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:02,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:34:02,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:34:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:34:02,032 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-12-03 18:34:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:02,109 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:34:02,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:34:02,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-03 18:34:02,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:02,110 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:34:02,110 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:34:02,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:34:02,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:34:02,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-03 18:34:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:34:02,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:34:02,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-03 18:34:02,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:02,114 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:34:02,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:34:02,114 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:34:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:34:02,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:02,115 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-03 18:34:02,115 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:02,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:02,115 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-03 18:34:02,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:02,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:02,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:02,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:02,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:02,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:02,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:02,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:02,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:02,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:02,405 INFO L192 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 [2018-12-03 18:34:02,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:34:02,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:34:02,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:34:02,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:02,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:02,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:02,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:02,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:02,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:02,566 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 [2018-12-03 18:34:02,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:02,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:02,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:02,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:02,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:02,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-03 18:34:02,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:02,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:34:02,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:34:02,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:34:02,793 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-12-03 18:34:02,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:02,905 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:34:02,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:34:02,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-12-03 18:34:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:02,907 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:34:02,908 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:34:02,908 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 [2018-12-03 18:34:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:34:02,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-03 18:34:02,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:34:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 18:34:02,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-03 18:34:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:02,912 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 18:34:02,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:34:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 18:34:02,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:34:02,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:02,912 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-03 18:34:02,913 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:02,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:02,913 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-03 18:34:02,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:02,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:02,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:02,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:03,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:03,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:03,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:03,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:03,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:03,261 INFO L192 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 [2018-12-03 18:34:03,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:03,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:03,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:03,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:34:03,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:03,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:03,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:03,553 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 [2018-12-03 18:34:03,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:03,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:03,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:03,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:03,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:03,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2018-12-03 18:34:03,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:03,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:34:03,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:34:03,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:34:03,795 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-12-03 18:34:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:03,932 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 18:34:03,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:34:03,933 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-12-03 18:34:03,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:03,934 INFO L225 Difference]: With dead ends: 16 [2018-12-03 18:34:03,934 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:34:03,935 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 [2018-12-03 18:34:03,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:34:03,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-03 18:34:03,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:34:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 18:34:03,938 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-03 18:34:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:03,938 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 18:34:03,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:34:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 18:34:03,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:34:03,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:03,939 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-03 18:34:03,939 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:03,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:03,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-03 18:34:03,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:03,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:03,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:03,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:03,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:04,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:04,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:04,300 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:04,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:04,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:04,301 INFO L192 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 [2018-12-03 18:34:04,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:34:04,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:34:04,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 18:34:04,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:04,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:04,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:04,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:04,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:04,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:04,521 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 [2018-12-03 18:34:04,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:04,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:04,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:04,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:05,065 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:05,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:05,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2018-12-03 18:34:05,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:05,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:34:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:34:05,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-12-03 18:34:05,088 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-12-03 18:34:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:05,314 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 18:34:05,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:34:05,314 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-12-03 18:34:05,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:05,315 INFO L225 Difference]: With dead ends: 18 [2018-12-03 18:34:05,316 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:34:05,317 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 [2018-12-03 18:34:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:34:05,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-03 18:34:05,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:34:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 18:34:05,321 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-03 18:34:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:05,321 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 18:34:05,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:34:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 18:34:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:34:05,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:05,322 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-03 18:34:05,322 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:05,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-03 18:34:05,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:05,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:05,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:05,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:05,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:05,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:05,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:05,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:05,640 INFO L192 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 [2018-12-03 18:34:05,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:34:05,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:34:05,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:34:05,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:05,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:05,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:05,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:05,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:05,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:05,901 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 [2018-12-03 18:34:05,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:05,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:05,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:05,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:06,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:06,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2018-12-03 18:34:06,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:06,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:34:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:34:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:34:06,221 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-12-03 18:34:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:06,457 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 18:34:06,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:34:06,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-12-03 18:34:06,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:06,458 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:34:06,458 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:34:06,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:34:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:34:06,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-03 18:34:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:34:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 18:34:06,464 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-03 18:34:06,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:06,464 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 18:34:06,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:34:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 18:34:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:34:06,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:06,465 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-03 18:34:06,465 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:06,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:06,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-03 18:34:06,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:06,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:06,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:06,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:06,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:06,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:06,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:06,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:06,850 INFO L192 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 [2018-12-03 18:34:06,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:06,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:06,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:06,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:06,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:06,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:06,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:07,102 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 [2018-12-03 18:34:07,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:07,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:07,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:07,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:07,392 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:07,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:07,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2018-12-03 18:34:07,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:07,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:34:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:34:07,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:34:07,414 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-12-03 18:34:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:07,908 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 18:34:07,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:34:07,908 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-12-03 18:34:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:07,910 INFO L225 Difference]: With dead ends: 22 [2018-12-03 18:34:07,910 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:34:07,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-12-03 18:34:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:34:07,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-03 18:34:07,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:34:07,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 18:34:07,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-03 18:34:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:07,915 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 18:34:07,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:34:07,915 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 18:34:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:34:07,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:07,916 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-03 18:34:07,916 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:07,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:07,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-03 18:34:07,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:07,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:07,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:07,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:07,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:08,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:08,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:08,291 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:08,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:08,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:08,291 INFO L192 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 [2018-12-03 18:34:08,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:34:08,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:34:08,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 18:34:08,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:08,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:08,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:08,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:08,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:08,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:08,515 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 [2018-12-03 18:34:08,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:08,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:08,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:08,535 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:08,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:09,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:09,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2018-12-03 18:34:09,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:09,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:34:09,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:34:09,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:34:09,056 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-12-03 18:34:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:09,377 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 18:34:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:34:09,377 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-12-03 18:34:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:09,379 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:34:09,379 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:34:09,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:34:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:34:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-03 18:34:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:34:09,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 18:34:09,384 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-03 18:34:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:09,384 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 18:34:09,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:34:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 18:34:09,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:34:09,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:09,385 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-03 18:34:09,386 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:09,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-03 18:34:09,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:09,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:09,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:09,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:09,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:09,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:09,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:09,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:09,796 INFO L192 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 [2018-12-03 18:34:09,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:34:09,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:34:09,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:34:09,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:09,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:09,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:09,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:09,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:09,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:10,433 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 [2018-12-03 18:34:10,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:10,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:10,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:10,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:10,822 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:10,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:10,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2018-12-03 18:34:10,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:10,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:34:10,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:34:10,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:34:10,843 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-12-03 18:34:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:11,113 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 18:34:11,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:34:11,113 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-12-03 18:34:11,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:11,114 INFO L225 Difference]: With dead ends: 26 [2018-12-03 18:34:11,114 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:34:11,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 18:34:11,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:34:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 18:34:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:34:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 18:34:11,122 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-03 18:34:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:11,122 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 18:34:11,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:34:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 18:34:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:34:11,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:11,123 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-03 18:34:11,123 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:11,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-03 18:34:11,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:11,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:11,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:11,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:11,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:11,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:11,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:11,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:11,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:11,671 INFO L192 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 [2018-12-03 18:34:11,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:11,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:11,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:11,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:11,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:11,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:11,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:12,064 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 [2018-12-03 18:34:12,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:12,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:12,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:12,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:12,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:12,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2018-12-03 18:34:12,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:12,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:34:12,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:34:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:34:12,677 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-12-03 18:34:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:13,028 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 18:34:13,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:34:13,029 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-12-03 18:34:13,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:13,030 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:34:13,030 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:34:13,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:34:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:34:13,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-03 18:34:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:34:13,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 18:34:13,036 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-03 18:34:13,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:13,036 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 18:34:13,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:34:13,037 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 18:34:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:34:13,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:13,037 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-03 18:34:13,038 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:13,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:13,038 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-03 18:34:13,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:13,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:13,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:13,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:13,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:13,622 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-12-03 18:34:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:13,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:13,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:13,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:13,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:13,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:13,652 INFO L192 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 [2018-12-03 18:34:13,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:34:13,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:34:13,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 18:34:13,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:13,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:13,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:34:13,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:13,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:13,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:13,996 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 [2018-12-03 18:34:13,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:14,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:14,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:14,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:14,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:14,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2018-12-03 18:34:14,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:14,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:34:14,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:34:14,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:34:14,507 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-12-03 18:34:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:14,855 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 18:34:14,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:34:14,856 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-12-03 18:34:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:14,857 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:34:14,857 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:34:14,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 18:34:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:34:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-03 18:34:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:34:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 18:34:14,862 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-03 18:34:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:14,863 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 18:34:14,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:34:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 18:34:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:34:14,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:14,864 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-03 18:34:14,864 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:14,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-03 18:34:14,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:14,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:14,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:14,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:14,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:15,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:15,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:15,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:15,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:15,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:15,585 INFO L192 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 [2018-12-03 18:34:15,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:34:15,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:34:15,605 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:34:15,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:15,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:15,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:15,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:15,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:15,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:15,951 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 [2018-12-03 18:34:15,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:15,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:15,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:15,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:16,692 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:16,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:16,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2018-12-03 18:34:16,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:16,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:34:16,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:34:16,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:34:16,712 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-12-03 18:34:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:17,145 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 18:34:17,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:34:17,147 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-12-03 18:34:17,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:17,147 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:34:17,148 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:34:17,149 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 [2018-12-03 18:34:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:34:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-03 18:34:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:34:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 18:34:17,153 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-03 18:34:17,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:17,153 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 18:34:17,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:34:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 18:34:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 18:34:17,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:17,154 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-03 18:34:17,154 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:17,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:17,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-03 18:34:17,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:17,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:17,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:17,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:17,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:17,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:17,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:17,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:17,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:17,983 INFO L192 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 [2018-12-03 18:34:17,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:17,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:18,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:18,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:18,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:18,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:18,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:18,402 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 [2018-12-03 18:34:18,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:18,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:18,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:18,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:19,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:19,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2018-12-03 18:34:19,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:19,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:34:19,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:34:19,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:34:19,198 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-12-03 18:34:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:19,996 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 18:34:19,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:34:19,997 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-12-03 18:34:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:19,997 INFO L225 Difference]: With dead ends: 34 [2018-12-03 18:34:19,998 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:34:20,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 18:34:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:34:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 18:34:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:34:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 18:34:20,005 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-03 18:34:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:20,005 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 18:34:20,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:34:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 18:34:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:34:20,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:20,006 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-03 18:34:20,006 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:20,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-03 18:34:20,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:20,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:20,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:20,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:20,288 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:34:20,529 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 18:34:20,712 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:34:21,404 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-03 18:34:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:21,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:21,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:21,409 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:21,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:21,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:21,409 INFO L192 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 [2018-12-03 18:34:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:34:21,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:34:21,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 18:34:21,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:21,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:21,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:21,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:21,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:21,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:21,859 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 [2018-12-03 18:34:21,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:21,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:21,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:21,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:23,113 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:23,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:23,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2018-12-03 18:34:23,132 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:23,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:34:23,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:34:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:34:23,134 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-12-03 18:34:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:23,781 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 18:34:23,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:34:23,781 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-12-03 18:34:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:23,782 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:34:23,783 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:34:23,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:34:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:34:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-03 18:34:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:34:23,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 18:34:23,789 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-03 18:34:23,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:23,790 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 18:34:23,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:34:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 18:34:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:34:23,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:23,791 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-03 18:34:23,791 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:23,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:23,792 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-03 18:34:23,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:23,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:23,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:23,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:23,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:24,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:24,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:24,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:24,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:24,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:24,426 INFO L192 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 [2018-12-03 18:34:24,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:34:24,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:34:24,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:34:24,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:24,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:24,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:24,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:24,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:24,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:24,947 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 [2018-12-03 18:34:24,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:24,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:24,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:24,977 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:24,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:26,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2018-12-03 18:34:26,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:34:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:34:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:34:26,965 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-12-03 18:34:27,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:27,451 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 18:34:27,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:34:27,452 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-12-03 18:34:27,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:27,453 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:34:27,453 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:34:27,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 18:34:27,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:34:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-03 18:34:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:34:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 18:34:27,459 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-03 18:34:27,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:27,460 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 18:34:27,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:34:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 18:34:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:34:27,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:27,460 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-03 18:34:27,461 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:27,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:27,461 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-03 18:34:27,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:27,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:27,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:27,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:27,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:27,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:27,713 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:34:27,951 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 18:34:28,181 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:34:28,799 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:28,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:28,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:28,799 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:28,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:28,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:28,800 INFO L192 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 [2018-12-03 18:34:28,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:28,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:28,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:28,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:34:28,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:28,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:28,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:29,407 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 [2018-12-03 18:34:29,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:29,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:29,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:29,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:30,319 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:30,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:30,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2018-12-03 18:34:30,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:30,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:34:30,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:34:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:34:30,341 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-12-03 18:34:31,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:31,403 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 18:34:31,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:34:31,404 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-12-03 18:34:31,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:31,404 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:34:31,405 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:34:31,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:34:31,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:34:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-03 18:34:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:34:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 18:34:31,411 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 18:34:31,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:31,411 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 18:34:31,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:34:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 18:34:31,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:34:31,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:31,412 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-03 18:34:31,413 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:31,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-03 18:34:31,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:31,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:31,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:31,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:31,681 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:34:31,917 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:34:32,201 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:34:32,509 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:34:32,846 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:34:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:33,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:33,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:33,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:33,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:33,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:33,485 INFO L192 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 [2018-12-03 18:34:33,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:34:33,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:34:33,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 18:34:33,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:33,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:33,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 [2018-12-03 18:34:33,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:33,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:33,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:34,169 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 [2018-12-03 18:34:34,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:34,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:34,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:34,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:35,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2018-12-03 18:34:35,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:35,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:34:35,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:34:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:34:35,176 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-12-03 18:34:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:36,168 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 18:34:36,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:34:36,168 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-12-03 18:34:36,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:36,169 INFO L225 Difference]: With dead ends: 42 [2018-12-03 18:34:36,169 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:34:36,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 18:34:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:34:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-03 18:34:36,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:34:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 18:34:36,176 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 18:34:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:36,176 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 18:34:36,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:34:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 18:34:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:34:36,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:36,178 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-03 18:34:36,178 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:36,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:36,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-03 18:34:36,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:36,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:36,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:36,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:36,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:36,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:36,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:36,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:36,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:36,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:36,960 INFO L192 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 [2018-12-03 18:34:36,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:34:36,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:34:37,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:34:37,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:37,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:37,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:34:37,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:37,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:37,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:37,749 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 [2018-12-03 18:34:37,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:37,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:37,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:37,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:38,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:38,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2018-12-03 18:34:38,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:38,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:34:38,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:34:38,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:34:38,861 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-12-03 18:34:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:39,859 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 18:34:39,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:34:39,859 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-12-03 18:34:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:39,860 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:34:39,860 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:34:39,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:34:39,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:34:39,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-03 18:34:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:34:39,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 18:34:39,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 18:34:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:39,867 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 18:34:39,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:34:39,867 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 18:34:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:34:39,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:39,867 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-03 18:34:39,868 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:39,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:39,868 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-03 18:34:39,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:39,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:39,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:39,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:40,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:40,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:40,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:40,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:40,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:40,939 INFO L192 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 [2018-12-03 18:34:40,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:40,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:40,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:40,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:34:40,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:40,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:40,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:41,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 [2018-12-03 18:34:41,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:41,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:41,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:41,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:42,823 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:42,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:42,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2018-12-03 18:34:42,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:42,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:34:42,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:34:42,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 18:34:42,844 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-12-03 18:34:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:43,714 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 18:34:43,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:34:43,714 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-12-03 18:34:43,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:43,715 INFO L225 Difference]: With dead ends: 46 [2018-12-03 18:34:43,715 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 18:34:43,717 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 [2018-12-03 18:34:43,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 18:34:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-03 18:34:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:34:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 18:34:43,722 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 18:34:43,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:43,723 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 18:34:43,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:34:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 18:34:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:34:43,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:43,724 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-03 18:34:43,724 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:43,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-03 18:34:43,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:43,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:43,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:43,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:43,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:44,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:44,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:44,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:44,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:44,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:44,493 INFO L192 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 [2018-12-03 18:34:44,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:34:44,502 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:34:44,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 18:34:44,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:44,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:44,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:44,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:44,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:44,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:45,323 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 [2018-12-03 18:34:45,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:45,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:45,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:45,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:47,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:47,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2018-12-03 18:34:47,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:47,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:34:47,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:34:47,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:34:47,008 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-12-03 18:34:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:47,894 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 18:34:47,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:34:47,894 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-12-03 18:34:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:47,895 INFO L225 Difference]: With dead ends: 48 [2018-12-03 18:34:47,895 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:34:47,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:34:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:34:47,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-03 18:34:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 18:34:47,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 18:34:47,902 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-03 18:34:47,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:47,902 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 18:34:47,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:34:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 18:34:47,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 18:34:47,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:47,903 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-03 18:34:47,903 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:47,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:47,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-03 18:34:47,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:47,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:47,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:47,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:47,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:48,118 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:34:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:48,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:48,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:48,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:48,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:48,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:48,766 INFO L192 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 [2018-12-03 18:34:48,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:34:48,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:34:48,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:34:48,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:48,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:48,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:48,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:48,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:48,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:49,642 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 [2018-12-03 18:34:49,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:49,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:49,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:49,680 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:49,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:51,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:51,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2018-12-03 18:34:51,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:51,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:34:51,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:34:51,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 18:34:51,551 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-12-03 18:34:52,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:52,672 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 18:34:52,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:34:52,674 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-12-03 18:34:52,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:52,674 INFO L225 Difference]: With dead ends: 50 [2018-12-03 18:34:52,674 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 18:34:52,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 18:34:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 18:34:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 18:34:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 18:34:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 18:34:52,679 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-03 18:34:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:52,679 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 18:34:52,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:34:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 18:34:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:34:52,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:52,680 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-03 18:34:52,680 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:52,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-03 18:34:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:52,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:34:52,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:52,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:52,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:52,957 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:34:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:53,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:53,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:53,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:53,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:53,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:53,745 INFO L192 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 [2018-12-03 18:34:53,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:53,753 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:34:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:53,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:53,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:34:53,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:53,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:53,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:54,593 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 [2018-12-03 18:34:54,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:54,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:54,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:54,638 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:54,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:34:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:56,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:34:56,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2018-12-03 18:34:56,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:34:56,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:34:56,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:34:56,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:34:56,331 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-12-03 18:34:57,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:34:57,493 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 18:34:57,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:34:57,493 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-12-03 18:34:57,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:34:57,494 INFO L225 Difference]: With dead ends: 52 [2018-12-03 18:34:57,494 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:34:57,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:34:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:34:57,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-03 18:34:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:34:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 18:34:57,500 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-03 18:34:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:34:57,501 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 18:34:57,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:34:57,501 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 18:34:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:34:57,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:34:57,502 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-03 18:34:57,502 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:34:57,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:34:57,502 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-03 18:34:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:34:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:57,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:34:57,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:34:57,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:34:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:34:58,318 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:58,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:58,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:34:58,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:34:58,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:34:58,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:34:58,319 INFO L192 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 [2018-12-03 18:34:58,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:34:58,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:34:58,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 18:34:58,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:34:58,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:34:58,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 [2018-12-03 18:34:58,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:58,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:58,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:34:59,258 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 [2018-12-03 18:34:59,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:34:59,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:34:59,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:34:59,298 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:34:59,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:00,845 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:00,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:00,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2018-12-03 18:35:00,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:00,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:35:00,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:35:00,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:35:00,867 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-12-03 18:35:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:02,466 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 18:35:02,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:35:02,467 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-12-03 18:35:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:02,468 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:35:02,468 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:35:02,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 18:35:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:35:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-03 18:35:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:35:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 18:35:02,479 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-03 18:35:02,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:02,479 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 18:35:02,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:35:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 18:35:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:35:02,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:02,485 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-03 18:35:02,486 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:02,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-03 18:35:02,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:02,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:02,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:35:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:02,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:02,749 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:35:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:03,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:03,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:03,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:03,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:03,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:03,612 INFO L192 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 [2018-12-03 18:35:03,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:35:03,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:35:03,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:35:03,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:03,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:03,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 [2018-12-03 18:35:03,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:03,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:03,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:04,618 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 [2018-12-03 18:35:04,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:04,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:04,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:04,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:07,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:07,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2018-12-03 18:35:07,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:07,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 18:35:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 18:35:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:35:07,744 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-12-03 18:35:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:08,929 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 18:35:08,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:35:08,929 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-12-03 18:35:08,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:08,930 INFO L225 Difference]: With dead ends: 56 [2018-12-03 18:35:08,930 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 18:35:08,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:35:08,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 18:35:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-03 18:35:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:35:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 18:35:08,935 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-03 18:35:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:08,935 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 18:35:08,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 18:35:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 18:35:08,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 18:35:08,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:08,936 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-03 18:35:08,936 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:08,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-03 18:35:08,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:08,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:35:08,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:08,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:09,139 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:35:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:10,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:10,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:10,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:10,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:10,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:10,043 INFO L192 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 [2018-12-03 18:35:10,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:10,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:10,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:10,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:35:10,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:10,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:10,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:11,096 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 [2018-12-03 18:35:11,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:11,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:11,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:11,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:13,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:13,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2018-12-03 18:35:13,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:13,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 18:35:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 18:35:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:35:13,263 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-12-03 18:35:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:14,514 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 18:35:14,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:35:14,515 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-12-03 18:35:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:14,516 INFO L225 Difference]: With dead ends: 58 [2018-12-03 18:35:14,516 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 18:35:14,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 18:35:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 18:35:14,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-03 18:35:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 18:35:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 18:35:14,520 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-03 18:35:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:14,520 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 18:35:14,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 18:35:14,521 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 18:35:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:35:14,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:14,521 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-03 18:35:14,522 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:14,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-03 18:35:14,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:14,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:14,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:14,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:14,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:15,536 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:15,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:15,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:15,537 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:15,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:15,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:15,537 INFO L192 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 [2018-12-03 18:35:15,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:35:15,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:35:15,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 18:35:15,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:15,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:15,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:35:15,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:15,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:15,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:17,101 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 [2018-12-03 18:35:17,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:17,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:17,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:17,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:19,050 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:19,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:19,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2018-12-03 18:35:19,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:19,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 18:35:19,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 18:35:19,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:35:19,071 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-12-03 18:35:20,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:20,819 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 18:35:20,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:35:20,820 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-12-03 18:35:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:20,820 INFO L225 Difference]: With dead ends: 60 [2018-12-03 18:35:20,821 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 18:35:20,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:35:20,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 18:35:20,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-03 18:35:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 18:35:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 18:35:20,825 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-03 18:35:20,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:20,825 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 18:35:20,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 18:35:20,825 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 18:35:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 18:35:20,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:20,826 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-03 18:35:20,826 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:20,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:20,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-03 18:35:20,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:20,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:35:20,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:20,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:22,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:22,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:22,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:22,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:22,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:22,173 INFO L192 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 [2018-12-03 18:35:22,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:35:22,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:35:22,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:35:22,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:22,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:22,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:35:22,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:22,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:22,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:23,423 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 [2018-12-03 18:35:23,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:23,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:23,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:23,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:25,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:25,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2018-12-03 18:35:25,556 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:25,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 18:35:25,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 18:35:25,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 18:35:25,558 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-12-03 18:35:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:27,184 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 18:35:27,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:35:27,184 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-12-03 18:35:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:27,185 INFO L225 Difference]: With dead ends: 62 [2018-12-03 18:35:27,185 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 18:35:27,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 18:35:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 18:35:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-12-03 18:35:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 18:35:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 18:35:27,189 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-03 18:35:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:27,189 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 18:35:27,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 18:35:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 18:35:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:35:27,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:27,190 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-03 18:35:27,190 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:27,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-03 18:35:27,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:27,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:27,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:35:27,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:27,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:27,451 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:35:27,671 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 18:35:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:28,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:28,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:28,641 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:28,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:28,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:28,641 INFO L192 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 [2018-12-03 18:35:28,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:28,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:28,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:28,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:35:28,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:28,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:28,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:29,947 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 [2018-12-03 18:35:29,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:29,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:29,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:29,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:32,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:32,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2018-12-03 18:35:32,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:32,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 18:35:32,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 18:35:32,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:35:32,413 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-12-03 18:35:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:33,847 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 18:35:33,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:35:33,848 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-12-03 18:35:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:33,848 INFO L225 Difference]: With dead ends: 64 [2018-12-03 18:35:33,849 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 18:35:33,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:35:33,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 18:35:33,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-12-03 18:35:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 18:35:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 18:35:33,854 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-03 18:35:33,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:33,854 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 18:35:33,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 18:35:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 18:35:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 18:35:33,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:33,855 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-03 18:35:33,855 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:33,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-03 18:35:33,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:33,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:33,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:33,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:33,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:34,069 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:35:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:35,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:35,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:35,038 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:35,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:35,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:35,038 INFO L192 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 [2018-12-03 18:35:35,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:35:35,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:35:35,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 18:35:35,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:35,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:35,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:35:35,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:35,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:35,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:36,456 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 [2018-12-03 18:35:36,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:36,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:36,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:36,503 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:36,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:39,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:39,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2018-12-03 18:35:39,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:39,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 18:35:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 18:35:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 18:35:39,108 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-12-03 18:35:41,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:41,039 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 18:35:41,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:35:41,040 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-12-03 18:35:41,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:41,041 INFO L225 Difference]: With dead ends: 66 [2018-12-03 18:35:41,041 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 18:35:41,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 18:35:41,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 18:35:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-03 18:35:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:35:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 18:35:41,046 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-03 18:35:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:41,046 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 18:35:41,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 18:35:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 18:35:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 18:35:41,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:41,047 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-03 18:35:41,047 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:41,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:41,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-03 18:35:41,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:41,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:35:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:41,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:41,249 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:35:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:42,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:42,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:42,513 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:42,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:42,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:42,514 INFO L192 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 [2018-12-03 18:35:42,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:35:42,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:35:42,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:35:42,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:42,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:42,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:35:42,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:42,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:42,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:43,988 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 [2018-12-03 18:35:43,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:43,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:43,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:44,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:46,591 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:46,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:46,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2018-12-03 18:35:46,611 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:46,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 18:35:46,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 18:35:46,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:35:46,612 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-12-03 18:35:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:48,438 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 18:35:48,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:35:48,438 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-12-03 18:35:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:48,439 INFO L225 Difference]: With dead ends: 68 [2018-12-03 18:35:48,439 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 18:35:48,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:35:48,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 18:35:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-03 18:35:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 18:35:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 18:35:48,444 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-03 18:35:48,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:48,445 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 18:35:48,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 18:35:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 18:35:48,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 18:35:48,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:48,445 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-03 18:35:48,446 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:48,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:48,446 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-03 18:35:48,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:48,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:35:48,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:48,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:48,689 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:35:49,821 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:49,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:49,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:49,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:49,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:49,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:49,822 INFO L192 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 [2018-12-03 18:35:49,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:49,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:35:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:49,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:49,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:35:49,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:49,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:49,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:51,396 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 [2018-12-03 18:35:51,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:51,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:51,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:51,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:35:54,349 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:35:54,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2018-12-03 18:35:54,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:35:54,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 18:35:54,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 18:35:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:35:54,371 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-12-03 18:35:56,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:35:56,329 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 18:35:56,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:35:56,330 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-12-03 18:35:56,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:35:56,330 INFO L225 Difference]: With dead ends: 70 [2018-12-03 18:35:56,331 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 18:35:56,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:35:56,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 18:35:56,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-03 18:35:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:35:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 18:35:56,335 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-03 18:35:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:35:56,336 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 18:35:56,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 18:35:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 18:35:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 18:35:56,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:35:56,337 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-03 18:35:56,337 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:35:56,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:35:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-03 18:35:56,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:35:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:56,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:35:56,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:35:56,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:35:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:35:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:57,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:57,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:35:57,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:35:57,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:35:57,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:35:57,834 INFO L192 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 [2018-12-03 18:35:57,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:35:57,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:35:57,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 18:35:57,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:35:57,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:35:57,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:35:57,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:57,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:57,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:35:59,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 [2018-12-03 18:35:59,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:35:59,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:35:59,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:35:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:35:59,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:02,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:02,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:02,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2018-12-03 18:36:02,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:02,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 18:36:02,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 18:36:02,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:36:02,362 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-12-03 18:36:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:05,223 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 18:36:05,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:36:05,224 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-12-03 18:36:05,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:05,224 INFO L225 Difference]: With dead ends: 72 [2018-12-03 18:36:05,224 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 18:36:05,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:36:05,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 18:36:05,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-12-03 18:36:05,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 18:36:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 18:36:05,228 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-03 18:36:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:05,229 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 18:36:05,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 18:36:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 18:36:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 18:36:05,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:05,230 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-03 18:36:05,230 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:05,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:05,230 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-03 18:36:05,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:05,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:05,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:05,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:05,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:05,488 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:36:05,661 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 18:36:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:06,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:06,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:06,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:06,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:06,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:06,832 INFO L192 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 [2018-12-03 18:36:06,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:36:06,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:36:06,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:36:06,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:06,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:06,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:36:06,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:06,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:06,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:36:08,733 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 [2018-12-03 18:36:08,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:08,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:08,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:36:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:08,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:11,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:11,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:11,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2018-12-03 18:36:11,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:11,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 18:36:11,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 18:36:11,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 18:36:11,719 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-12-03 18:36:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:14,172 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 18:36:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:36:14,172 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-12-03 18:36:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:14,173 INFO L225 Difference]: With dead ends: 74 [2018-12-03 18:36:14,174 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 18:36:14,175 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 [2018-12-03 18:36:14,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 18:36:14,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 18:36:14,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 18:36:14,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 18:36:14,178 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-03 18:36:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:14,179 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 18:36:14,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 18:36:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 18:36:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 18:36:14,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:14,180 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-03 18:36:14,180 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:14,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:14,180 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-03 18:36:14,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:14,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:14,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:14,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:14,439 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:36:14,670 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 18:36:14,928 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:36:15,209 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:36:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:16,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:16,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:16,555 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:16,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:16,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:16,556 INFO L192 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 [2018-12-03 18:36:16,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:16,565 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:16,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:16,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:36:16,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:16,602 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:16,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:36:18,719 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 [2018-12-03 18:36:18,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:18,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:18,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:36:18,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:18,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:21,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:22,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:22,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2018-12-03 18:36:22,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:22,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 18:36:22,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 18:36:22,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:36:22,008 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-12-03 18:36:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:24,625 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 18:36:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:36:24,626 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-12-03 18:36:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:24,627 INFO L225 Difference]: With dead ends: 76 [2018-12-03 18:36:24,627 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 18:36:24,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:36:24,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 18:36:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-03 18:36:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 18:36:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 18:36:24,632 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-03 18:36:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:24,632 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 18:36:24,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 18:36:24,633 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 18:36:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 18:36:24,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:24,633 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-03 18:36:24,633 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:24,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-03 18:36:24,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:24,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:24,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:24,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:24,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:26,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:26,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:26,183 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:26,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:26,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:26,183 INFO L192 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 [2018-12-03 18:36:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:36:26,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:36:26,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 18:36:26,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:26,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:26,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:36:26,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:26,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:26,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:36:28,393 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 [2018-12-03 18:36:28,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:28,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:28,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:36:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:28,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:31,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:31,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2018-12-03 18:36:31,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:31,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 18:36:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 18:36:31,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 18:36:31,862 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-12-03 18:36:34,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:34,963 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 18:36:34,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:36:34,964 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-12-03 18:36:34,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:34,965 INFO L225 Difference]: With dead ends: 78 [2018-12-03 18:36:34,965 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 18:36:34,966 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 [2018-12-03 18:36:34,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 18:36:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-03 18:36:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 18:36:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 18:36:34,969 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-03 18:36:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:34,969 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 18:36:34,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 18:36:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 18:36:34,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 18:36:34,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:34,970 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-03 18:36:34,970 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:34,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:34,970 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-03 18:36:34,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:34,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:34,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:34,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:36,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:36,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:36,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:36,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:36,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:36,510 INFO L192 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 [2018-12-03 18:36:36,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:36:36,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:36:36,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:36:36,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:36,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:36,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:36:36,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:36,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:36,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:36:38,778 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 [2018-12-03 18:36:38,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:38,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:38,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:36:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:38,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:42,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:42,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2018-12-03 18:36:42,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:42,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 18:36:42,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 18:36:42,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:36:42,399 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-12-03 18:36:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:45,497 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 18:36:45,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:36:45,497 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-12-03 18:36:45,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:45,498 INFO L225 Difference]: With dead ends: 80 [2018-12-03 18:36:45,498 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 18:36:45,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:36:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 18:36:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-12-03 18:36:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 18:36:45,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 18:36:45,503 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-03 18:36:45,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:45,503 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 18:36:45,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 18:36:45,503 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 18:36:45,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 18:36:45,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:45,504 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-03 18:36:45,504 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:45,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:45,504 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-03 18:36:45,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:45,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:45,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:36:45,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:45,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:45,774 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:36:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:47,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:47,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:47,251 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:47,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:47,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:47,252 INFO L192 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 [2018-12-03 18:36:47,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:47,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:36:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:47,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:47,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:36:47,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:47,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:47,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:36:49,639 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 [2018-12-03 18:36:49,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:49,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:49,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:36:49,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:49,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:36:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:53,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:36:53,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2018-12-03 18:36:53,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:36:53,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 18:36:53,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 18:36:53,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 18:36:53,381 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-12-03 18:36:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:36:56,254 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 18:36:56,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:36:56,255 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-12-03 18:36:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:36:56,256 INFO L225 Difference]: With dead ends: 82 [2018-12-03 18:36:56,256 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 18:36:56,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 18:36:56,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 18:36:56,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-03 18:36:56,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 18:36:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 18:36:56,260 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-03 18:36:56,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:36:56,261 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 18:36:56,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 18:36:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 18:36:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 18:36:56,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:36:56,261 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-03 18:36:56,262 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:36:56,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:36:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-03 18:36:56,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:36:56,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:56,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:36:56,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:36:56,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:36:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:36:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:36:57,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:57,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:36:57,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:36:57,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:36:57,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:36:57,919 INFO L192 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 [2018-12-03 18:36:57,928 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:36:57,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:36:57,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 18:36:57,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:36:57,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:36:58,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:36:58,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:36:58,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:36:58,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:37:00,429 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 [2018-12-03 18:37:00,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:00,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:00,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:37:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:00,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:04,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:04,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2018-12-03 18:37:04,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:04,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 18:37:04,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 18:37:04,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:37:04,802 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-12-03 18:37:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:08,333 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 18:37:08,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:37:08,333 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-12-03 18:37:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:08,334 INFO L225 Difference]: With dead ends: 84 [2018-12-03 18:37:08,334 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 18:37:08,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:37:08,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 18:37:08,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-03 18:37:08,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 18:37:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 18:37:08,339 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-03 18:37:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:08,340 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 18:37:08,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 18:37:08,340 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 18:37:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 18:37:08,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:08,340 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-03 18:37:08,340 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:08,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-03 18:37:08,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:08,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:37:08,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:08,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:08,614 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:37:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:10,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:10,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:10,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:37:10,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:37:10,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:10,504 INFO L192 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 [2018-12-03 18:37:10,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:37:10,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:37:10,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:37:10,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:37:10,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:10,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:37:10,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:10,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:10,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:37:12,877 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 [2018-12-03 18:37:12,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:12,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:12,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:37:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:12,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:17,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:17,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:17,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2018-12-03 18:37:17,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:17,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 18:37:17,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 18:37:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 18:37:17,184 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-12-03 18:37:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:20,199 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 18:37:20,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:37:20,199 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-12-03 18:37:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:20,200 INFO L225 Difference]: With dead ends: 86 [2018-12-03 18:37:20,200 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 18:37:20,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 18:37:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 18:37:20,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-03 18:37:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 18:37:20,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 18:37:20,206 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-03 18:37:20,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:20,206 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 18:37:20,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 18:37:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 18:37:20,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 18:37:20,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:20,207 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-03 18:37:20,207 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:20,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:20,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-03 18:37:20,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:20,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:37:20,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:20,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:20,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:20,466 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:37:20,717 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:37:20,983 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:37:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:22,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:22,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:22,680 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:37:22,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:37:22,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:22,680 INFO L192 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 [2018-12-03 18:37:22,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:22,690 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:37:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:22,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:22,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:37:22,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:22,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:22,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:37:25,324 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 [2018-12-03 18:37:25,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:25,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:25,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:37:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:25,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:29,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:29,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2018-12-03 18:37:29,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:29,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 18:37:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 18:37:29,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:37:29,785 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-12-03 18:37:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:33,857 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 18:37:33,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:37:33,858 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-12-03 18:37:33,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:33,859 INFO L225 Difference]: With dead ends: 88 [2018-12-03 18:37:33,859 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 18:37:33,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:37:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 18:37:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-12-03 18:37:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 18:37:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 18:37:33,865 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-03 18:37:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:33,866 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 18:37:33,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 18:37:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 18:37:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 18:37:33,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:33,867 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-03 18:37:33,867 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:33,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-03 18:37:33,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:33,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:33,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:37:33,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:33,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:34,138 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:37:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:36,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:36,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:36,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:37:36,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:37:36,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:36,090 INFO L192 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 [2018-12-03 18:37:36,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:37:36,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:37:36,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 18:37:36,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:37:36,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:36,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:37:36,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:36,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:36,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:37:38,731 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 [2018-12-03 18:37:38,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:38,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:38,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:37:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:38,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:43,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:43,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2018-12-03 18:37:43,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:43,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 18:37:43,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 18:37:43,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 18:37:43,397 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-12-03 18:37:48,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:37:48,171 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 18:37:48,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:37:48,172 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-12-03 18:37:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:37:48,173 INFO L225 Difference]: With dead ends: 90 [2018-12-03 18:37:48,173 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 18:37:48,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 18:37:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 18:37:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-03 18:37:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 18:37:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 18:37:48,177 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-03 18:37:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:37:48,177 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 18:37:48,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 18:37:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 18:37:48,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 18:37:48,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:37:48,178 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-03 18:37:48,178 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:37:48,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:37:48,178 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-03 18:37:48,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:37:48,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:48,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:37:48,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:37:48,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:37:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:37:48,406 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:37:50,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:50,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:50,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:37:50,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:37:50,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:37:50,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:37:50,144 INFO L192 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 [2018-12-03 18:37:50,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:37:50,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:37:50,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:37:50,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:37:50,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:37:50,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:37:50,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:50,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:50,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:37:53,042 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 [2018-12-03 18:37:53,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:37:53,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:37:53,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:37:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:53,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:37:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:37:58,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:37:58,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2018-12-03 18:37:58,117 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:37:58,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 18:37:58,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 18:37:58,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:37:58,119 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-12-03 18:38:02,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:02,857 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 18:38:02,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:38:02,857 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-12-03 18:38:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:02,858 INFO L225 Difference]: With dead ends: 92 [2018-12-03 18:38:02,858 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 18:38:02,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:38:02,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 18:38:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-03 18:38:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 18:38:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 18:38:02,864 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-03 18:38:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:02,864 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 18:38:02,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 18:38:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 18:38:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 18:38:02,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:02,865 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-03 18:38:02,865 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:02,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:02,865 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-03 18:38:02,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:02,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:38:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:02,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:03,067 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:38:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:04,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:04,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:04,909 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:38:04,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:38:04,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:04,909 INFO L192 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 [2018-12-03 18:38:04,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:04,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:38:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:04,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:04,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:38:04,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:38:04,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:38:04,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:38:07,975 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 [2018-12-03 18:38:07,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:38:07,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:38:07,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:38:08,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:08,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:13,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:13,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2018-12-03 18:38:13,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:13,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 18:38:13,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 18:38:13,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 18:38:13,106 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-12-03 18:38:17,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:17,017 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 18:38:17,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:38:17,018 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-12-03 18:38:17,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:17,019 INFO L225 Difference]: With dead ends: 94 [2018-12-03 18:38:17,019 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 18:38:17,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 18:38:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 18:38:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-03 18:38:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 18:38:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 18:38:17,024 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-03 18:38:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:17,024 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 18:38:17,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 18:38:17,025 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 18:38:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 18:38:17,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:17,025 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-03 18:38:17,025 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:17,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:17,025 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-03 18:38:17,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:17,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:17,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:17,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:17,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:17,297 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:38:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:19,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:19,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:19,219 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:38:19,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:38:19,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:19,219 INFO L192 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 [2018-12-03 18:38:19,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:38:19,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:38:19,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 18:38:19,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:38:19,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:19,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 [2018-12-03 18:38:19,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:38:19,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:38:19,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:38:22,925 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 [2018-12-03 18:38:22,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:38:22,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:38:22,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:38:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:23,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:28,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:28,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2018-12-03 18:38:28,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:28,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 18:38:28,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 18:38:28,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:38:28,321 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-12-03 18:38:32,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:32,593 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 18:38:32,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:38:32,593 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-12-03 18:38:32,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:32,594 INFO L225 Difference]: With dead ends: 96 [2018-12-03 18:38:32,594 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 18:38:32,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:38:32,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 18:38:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-03 18:38:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 18:38:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 18:38:32,599 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-03 18:38:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:32,599 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 18:38:32,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 18:38:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 18:38:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 18:38:32,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:32,600 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-03 18:38:32,600 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:32,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:32,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-03 18:38:32,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:32,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:32,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:38:32,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:32,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:32,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:32,877 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:38:33,129 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:38:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:35,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:35,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:35,159 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:38:35,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:38:35,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:35,159 INFO L192 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 [2018-12-03 18:38:35,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:38:35,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:38:35,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:38:35,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:38:35,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:35,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:38:35,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:38:35,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:38:35,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:38:38,482 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 [2018-12-03 18:38:38,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:38:38,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:38:38,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:38:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:38,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:38:44,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:44,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:38:44,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2018-12-03 18:38:44,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:38:44,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 18:38:44,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 18:38:44,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 18:38:44,091 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-12-03 18:38:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:38:48,691 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 18:38:48,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:38:48,691 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-12-03 18:38:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:38:48,692 INFO L225 Difference]: With dead ends: 98 [2018-12-03 18:38:48,692 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 18:38:48,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 18:38:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 18:38:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 18:38:48,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 18:38:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 18:38:48,698 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-03 18:38:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:38:48,698 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 18:38:48,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 18:38:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 18:38:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 18:38:48,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:38:48,698 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-03 18:38:48,699 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:38:48,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:38:48,699 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-03 18:38:48,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:38:48,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:48,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:38:48,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:38:48,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:38:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:50,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:50,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:38:50,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:38:50,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:38:50,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:38:50,866 INFO L192 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 [2018-12-03 18:38:50,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:38:50,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:38:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:38:50,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:38:50,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:38:50,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:38:50,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:38:50,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:38:54,291 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 [2018-12-03 18:38:54,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:38:54,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:38:54,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:38:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:38:54,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:39:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:00,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:39:00,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2018-12-03 18:39:00,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:39:00,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 18:39:00,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 18:39:00,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:39:00,131 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-12-03 18:39:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:04,460 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 18:39:04,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:39:04,461 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-12-03 18:39:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:04,462 INFO L225 Difference]: With dead ends: 100 [2018-12-03 18:39:04,462 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 18:39:04,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 18:39:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 18:39:04,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-03 18:39:04,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 18:39:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 18:39:04,467 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-03 18:39:04,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:04,467 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 18:39:04,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 18:39:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 18:39:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 18:39:04,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:04,468 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-03 18:39:04,468 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:04,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-03 18:39:04,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:04,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:04,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:04,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:04,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:06,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:06,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:06,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:39:06,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:39:06,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:06,750 INFO L192 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 [2018-12-03 18:39:06,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:39:06,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:39:06,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 18:39:06,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:39:06,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:39:06,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:39:06,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:39:06,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:39:06,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:39:10,717 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 [2018-12-03 18:39:10,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:39:10,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:39:10,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:39:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:10,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:39:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:16,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:39:16,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2018-12-03 18:39:16,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:39:16,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 18:39:16,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 18:39:16,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 18:39:16,799 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-12-03 18:39:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:21,109 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 18:39:21,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:39:21,110 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-12-03 18:39:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:21,111 INFO L225 Difference]: With dead ends: 102 [2018-12-03 18:39:21,111 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 18:39:21,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 18:39:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 18:39:21,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-03 18:39:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 18:39:21,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 18:39:21,116 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-03 18:39:21,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:21,116 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 18:39:21,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 18:39:21,117 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 18:39:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 18:39:21,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:21,117 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-03 18:39:21,117 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:21,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:21,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-03 18:39:21,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:21,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:39:21,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:21,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:21,371 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:39:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:23,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:23,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:23,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:39:23,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:39:23,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:23,745 INFO L192 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 [2018-12-03 18:39:23,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:39:23,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:39:23,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:39:23,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:39:23,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:39:23,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:39:23,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:39:23,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:39:23,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:39:27,162 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 [2018-12-03 18:39:27,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:39:27,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:39:27,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:39:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:27,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:39:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:33,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:39:33,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2018-12-03 18:39:33,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:39:33,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 18:39:33,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 18:39:33,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:39:33,658 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-12-03 18:39:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:38,174 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 18:39:38,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:39:38,174 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-12-03 18:39:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:38,175 INFO L225 Difference]: With dead ends: 104 [2018-12-03 18:39:38,175 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 18:39:38,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 18:39:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 18:39:38,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-03 18:39:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 18:39:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 18:39:38,181 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-03 18:39:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:38,182 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 18:39:38,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 18:39:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 18:39:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 18:39:38,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:38,183 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-03 18:39:38,183 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:38,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-03 18:39:38,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:38,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:38,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:39:38,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:38,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:40,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:40,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:40,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:39:40,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:39:40,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:40,469 INFO L192 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 [2018-12-03 18:39:40,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:40,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:39:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:40,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:39:40,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:39:40,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:39:40,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:39:40,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:39:44,284 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 [2018-12-03 18:39:44,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:39:44,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:39:44,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:39:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:44,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:39:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:50,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:39:50,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2018-12-03 18:39:50,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:39:50,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 18:39:50,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 18:39:50,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 18:39:50,899 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2018-12-03 18:39:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:39:55,788 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 18:39:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 18:39:55,788 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2018-12-03 18:39:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:39:55,789 INFO L225 Difference]: With dead ends: 106 [2018-12-03 18:39:55,789 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 18:39:55,790 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 [2018-12-03 18:39:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 18:39:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-03 18:39:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 18:39:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 18:39:55,796 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-03 18:39:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:39:55,796 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 18:39:55,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 18:39:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 18:39:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 18:39:55,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:39:55,797 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-03 18:39:55,797 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:39:55,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:39:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-03 18:39:55,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:39:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:55,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:39:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:39:55,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:39:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:39:56,068 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:39:56,321 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:39:56,571 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:39:56,876 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:39:57,171 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:39:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:39:59,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:59,659 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:39:59,659 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:39:59,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:39:59,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:39:59,659 INFO L192 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 [2018-12-03 18:39:59,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:39:59,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:39:59,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 18:39:59,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:39:59,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:39:59,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:39:59,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:39:59,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:39:59,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:40:03,664 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 [2018-12-03 18:40:03,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:40:03,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:40:03,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:40:03,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:40:03,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:40:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:40:10,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:40:10,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2018-12-03 18:40:10,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:40:10,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 18:40:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 18:40:10,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:40:10,457 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2018-12-03 18:40:16,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:16,127 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 18:40:16,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:40:16,128 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2018-12-03 18:40:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:16,129 INFO L225 Difference]: With dead ends: 108 [2018-12-03 18:40:16,129 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 18:40:16,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 18:40:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 18:40:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-03 18:40:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 18:40:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 18:40:16,136 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-03 18:40:16,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:16,136 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 18:40:16,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 18:40:16,136 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 18:40:16,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 18:40:16,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:16,137 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-03 18:40:16,137 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:16,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-03 18:40:16,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:16,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:40:16,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:16,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:40:18,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:18,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:18,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:40:18,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:40:18,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:18,745 INFO L192 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 [2018-12-03 18:40:18,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:40:18,754 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:40:18,786 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:40:18,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:40:18,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:40:18,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:40:18,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:40:18,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:40:18,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:40:22,621 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 [2018-12-03 18:40:22,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:40:22,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:40:22,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:40:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:40:22,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:40:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:40:29,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:40:29,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2018-12-03 18:40:29,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:40:29,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 18:40:29,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 18:40:29,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 18:40:29,963 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2018-12-03 18:40:36,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:36,946 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 18:40:36,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:40:36,947 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2018-12-03 18:40:36,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:36,948 INFO L225 Difference]: With dead ends: 110 [2018-12-03 18:40:36,948 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 18:40:36,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 18:40:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 18:40:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-12-03 18:40:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 18:40:36,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 18:40:36,955 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-03 18:40:36,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:36,956 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 18:40:36,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 18:40:36,956 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 18:40:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 18:40:36,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:36,956 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-03 18:40:36,957 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:36,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-03 18:40:36,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:36,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:40:36,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:36,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:37,208 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:40:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:40:40,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:40,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:40:40,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:40:40,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:40:40,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:40:40,060 INFO L192 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 [2018-12-03 18:40:40,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:40,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:40:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:40,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:40:40,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:40:40,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:40:40,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:40:40,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:40:44,512 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 [2018-12-03 18:40:44,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:40:44,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:40:44,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:40:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:40:44,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:40:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:40:51,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:40:51,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2018-12-03 18:40:51,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:40:51,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 18:40:51,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 18:40:51,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:40:51,981 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2018-12-03 18:40:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:40:56,819 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 18:40:56,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 18:40:56,819 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2018-12-03 18:40:56,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:40:56,820 INFO L225 Difference]: With dead ends: 112 [2018-12-03 18:40:56,831 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 18:40:56,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 18:40:56,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 18:40:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-12-03 18:40:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 18:40:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 18:40:56,836 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-03 18:40:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:40:56,836 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 18:40:56,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 18:40:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 18:40:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 18:40:56,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:40:56,837 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-03 18:40:56,837 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:40:56,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:40:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-03 18:40:56,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:40:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:56,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:40:56,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:40:56,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:40:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:40:57,127 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:40:57,396 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:40:57,648 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:41:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:00,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:00,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:00,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:41:00,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:41:00,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:00,387 INFO L192 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 [2018-12-03 18:41:00,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:41:00,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:41:00,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 18:41:00,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:41:00,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:41:00,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:41:00,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:41:00,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:41:00,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:41:04,455 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 [2018-12-03 18:41:04,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:41:04,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:41:04,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:41:04,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:04,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:41:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:12,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:41:12,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2018-12-03 18:41:12,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:41:12,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 18:41:12,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 18:41:12,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 18:41:12,213 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2018-12-03 18:41:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:18,611 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 18:41:18,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 18:41:18,612 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2018-12-03 18:41:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:18,613 INFO L225 Difference]: With dead ends: 114 [2018-12-03 18:41:18,613 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 18:41:18,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 18:41:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 18:41:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-03 18:41:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 18:41:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 18:41:18,620 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-03 18:41:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:18,620 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 18:41:18,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 18:41:18,620 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 18:41:18,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 18:41:18,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:18,621 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-03 18:41:18,621 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:18,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:18,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-03 18:41:18,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:18,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:41:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:18,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:21,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:21,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:21,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:41:21,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:41:21,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:21,611 INFO L192 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 [2018-12-03 18:41:21,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:41:21,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:41:21,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:41:21,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:41:21,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:41:21,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 [2018-12-03 18:41:21,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:41:21,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:41:21,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:41:26,043 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 [2018-12-03 18:41:26,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:41:26,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:41:26,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:41:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:26,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:41:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:41:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2018-12-03 18:41:33,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:41:33,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-12-03 18:41:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-12-03 18:41:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 18:41:33,721 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2018-12-03 18:41:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:41:39,231 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 18:41:39,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:41:39,231 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2018-12-03 18:41:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:41:39,233 INFO L225 Difference]: With dead ends: 116 [2018-12-03 18:41:39,233 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 18:41:39,234 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 [2018-12-03 18:41:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 18:41:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-03 18:41:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 18:41:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 18:41:39,239 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-03 18:41:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:41:39,240 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 18:41:39,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-12-03 18:41:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 18:41:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 18:41:39,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:41:39,241 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-03 18:41:39,241 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:41:39,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:41:39,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-03 18:41:39,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:41:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:39,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:41:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:41:39,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:41:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:42,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:42,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:41:42,281 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:41:42,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:41:42,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:41:42,281 INFO L192 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 [2018-12-03 18:41:42,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:41:42,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:41:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:41:42,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:41:42,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:41:42,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:41:42,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:41:42,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:41:46,789 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 [2018-12-03 18:41:46,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:41:46,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:41:46,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:41:46,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:46,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:41:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:41:54,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:41:54,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2018-12-03 18:41:54,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:41:54,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-12-03 18:41:54,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-12-03 18:41:54,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 18:41:54,739 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2018-12-03 18:42:02,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:02,231 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 18:42:02,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:42:02,232 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2018-12-03 18:42:02,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:02,233 INFO L225 Difference]: With dead ends: 118 [2018-12-03 18:42:02,233 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 18:42:02,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 18:42:02,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 18:42:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-12-03 18:42:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 18:42:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 18:42:02,239 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-03 18:42:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:02,240 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 18:42:02,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-12-03 18:42:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 18:42:02,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 18:42:02,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:02,241 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-03 18:42:02,241 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:02,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:02,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-03 18:42:02,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:02,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:42:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:02,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:02,513 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:42:02,746 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:42:03,012 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:42:03,294 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:42:03,621 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:42:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:06,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:06,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:06,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:42:06,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:42:06,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:06,539 INFO L192 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 [2018-12-03 18:42:06,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:42:06,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:42:06,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 18:42:06,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:42:06,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:42:06,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:42:06,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:42:06,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:42:06,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:42:11,120 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 [2018-12-03 18:42:11,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:42:11,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:42:11,125 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:42:11,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:11,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:42:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:19,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:42:19,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2018-12-03 18:42:19,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:42:19,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 18:42:19,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 18:42:19,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 18:42:19,611 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2018-12-03 18:42:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:25,701 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-03 18:42:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 18:42:25,701 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2018-12-03 18:42:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:25,702 INFO L225 Difference]: With dead ends: 120 [2018-12-03 18:42:25,702 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 18:42:25,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 18:42:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 18:42:25,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-03 18:42:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 18:42:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 18:42:25,707 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-03 18:42:25,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:25,707 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 18:42:25,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 18:42:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 18:42:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 18:42:25,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:25,708 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-03 18:42:25,708 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:25,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-03 18:42:25,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:25,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:42:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:25,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:25,913 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:42:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:28,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:28,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:28,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:42:28,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:42:28,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:28,991 INFO L192 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 [2018-12-03 18:42:28,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:42:28,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:42:29,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:42:29,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:42:29,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:42:29,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:42:29,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:42:29,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:42:29,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:42:34,193 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 [2018-12-03 18:42:34,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:42:34,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:42:34,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:42:34,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:34,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:42:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:43,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:42:43,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2018-12-03 18:42:43,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:42:43,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-12-03 18:42:43,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-12-03 18:42:43,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 18:42:43,017 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2018-12-03 18:42:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:42:48,452 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-12-03 18:42:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 18:42:48,452 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2018-12-03 18:42:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:42:48,453 INFO L225 Difference]: With dead ends: 122 [2018-12-03 18:42:48,453 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 18:42:48,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 18:42:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 18:42:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 18:42:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 18:42:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-03 18:42:48,459 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-03 18:42:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:42:48,459 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-03 18:42:48,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-12-03 18:42:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-03 18:42:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 18:42:48,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:42:48,460 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-03 18:42:48,460 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:42:48,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:42:48,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-03 18:42:48,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:42:48,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:48,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:42:48,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:42:48,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:42:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:51,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:51,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:42:51,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:42:51,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:42:51,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:42:51,474 INFO L192 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 [2018-12-03 18:42:51,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:42:51,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:42:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:42:51,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:42:51,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:42:51,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:42:51,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:42:51,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:42:56,606 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 [2018-12-03 18:42:56,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:42:56,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:42:56,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:42:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:42:56,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:43:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:43:05,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:43:05,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2018-12-03 18:43:05,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:43:05,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-12-03 18:43:05,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-12-03 18:43:05,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 18:43:05,635 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2018-12-03 18:43:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:43:13,091 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-12-03 18:43:13,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 18:43:13,100 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2018-12-03 18:43:13,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:43:13,101 INFO L225 Difference]: With dead ends: 124 [2018-12-03 18:43:13,101 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 18:43:13,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 18:43:13,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 18:43:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-12-03 18:43:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 18:43:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-03 18:43:13,107 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-03 18:43:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:43:13,107 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-03 18:43:13,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-12-03 18:43:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-03 18:43:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 18:43:13,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:43:13,108 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-03 18:43:13,108 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:43:13,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:13,109 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-03 18:43:13,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:43:13,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:13,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:43:13,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:13,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:43:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:43:16,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:16,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:43:16,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:43:16,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:43:16,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:16,204 INFO L192 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 [2018-12-03 18:43:16,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:43:16,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:43:16,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 18:43:16,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:43:16,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:43:16,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:43:16,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:43:16,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:43:16,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:43:21,479 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 [2018-12-03 18:43:21,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:43:21,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:43:21,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:43:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:43:21,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:43:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:43:30,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:43:30,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2018-12-03 18:43:30,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:43:30,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-03 18:43:30,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-03 18:43:30,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 18:43:30,754 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2018-12-03 18:43:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:43:39,828 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-12-03 18:43:39,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:43:39,828 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2018-12-03 18:43:39,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:43:39,829 INFO L225 Difference]: With dead ends: 126 [2018-12-03 18:43:39,829 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 18:43:39,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 18:43:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 18:43:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-12-03 18:43:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 18:43:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-03 18:43:39,836 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-03 18:43:39,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:43:39,837 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-03 18:43:39,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-03 18:43:39,837 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-03 18:43:39,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 18:43:39,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:43:39,838 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-03 18:43:39,838 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:43:39,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:43:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-03 18:43:39,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:43:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:39,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:43:39,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:43:39,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:43:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:43:40,113 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:43:40,367 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:43:40,616 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:43:40,860 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 18:43:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:43:44,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:44,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:43:44,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:43:44,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:43:44,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:43:44,171 INFO L192 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 [2018-12-03 18:43:44,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:43:44,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:43:44,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:43:44,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:43:44,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:43:44,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:43:44,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:43:44,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:43:44,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:43:49,421 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 [2018-12-03 18:43:49,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:43:49,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:43:49,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:43:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:43:49,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:43:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:43:59,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:43:59,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2018-12-03 18:43:59,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:43:59,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-12-03 18:43:59,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-12-03 18:43:59,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 18:43:59,043 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2018-12-03 18:44:08,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:44:08,061 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-12-03 18:44:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 18:44:08,062 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2018-12-03 18:44:08,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:44:08,063 INFO L225 Difference]: With dead ends: 128 [2018-12-03 18:44:08,063 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 18:44:08,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 18:44:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 18:44:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-12-03 18:44:08,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 18:44:08,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-03 18:44:08,069 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-03 18:44:08,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:44:08,070 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-03 18:44:08,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-12-03 18:44:08,070 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-03 18:44:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 18:44:08,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:44:08,070 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-03 18:44:08,070 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:44:08,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:44:08,071 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-03 18:44:08,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:44:08,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:08,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:44:08,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:08,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:44:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:44:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:44:11,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:11,596 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:44:11,596 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:44:11,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:44:11,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:11,596 INFO L192 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 [2018-12-03 18:44:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:44:11,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:44:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:44:11,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:44:11,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:44:11,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:44:11,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:44:11,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:44:17,204 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 [2018-12-03 18:44:17,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:44:17,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:44:17,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:44:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:44:17,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:44:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:44:27,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:44:27,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2018-12-03 18:44:27,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:44:27,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-12-03 18:44:27,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-12-03 18:44:27,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 18:44:27,094 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2018-12-03 18:44:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:44:35,082 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-12-03 18:44:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 18:44:35,082 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2018-12-03 18:44:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:44:35,083 INFO L225 Difference]: With dead ends: 130 [2018-12-03 18:44:35,083 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 18:44:35,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 18:44:35,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 18:44:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-03 18:44:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 18:44:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-03 18:44:35,089 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-03 18:44:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:44:35,090 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-03 18:44:35,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-12-03 18:44:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-03 18:44:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 18:44:35,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:44:35,091 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-03 18:44:35,091 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:44:35,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:44:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-03 18:44:35,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:44:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:35,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:44:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:44:35,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:44:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:44:35,367 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:44:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:44:38,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:38,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:44:38,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:44:38,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:44:38,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:44:38,638 INFO L192 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 [2018-12-03 18:44:38,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:44:38,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:44:38,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 18:44:38,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:44:38,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:44:38,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:44:38,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:44:38,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:44:38,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:44:44,563 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 [2018-12-03 18:44:44,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:44:44,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:44:44,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:44:44,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:44:44,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:44:54,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:44:54,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:44:54,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2018-12-03 18:44:54,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:44:54,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-03 18:44:54,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-03 18:44:54,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 18:44:54,750 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2018-12-03 18:45:01,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:45:01,224 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-12-03 18:45:01,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 18:45:01,225 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2018-12-03 18:45:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:45:01,226 INFO L225 Difference]: With dead ends: 132 [2018-12-03 18:45:01,226 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 18:45:01,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 18:45:01,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 18:45:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-03 18:45:01,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 18:45:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-03 18:45:01,232 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-03 18:45:01,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:45:01,232 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-03 18:45:01,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-03 18:45:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-03 18:45:01,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 18:45:01,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:45:01,233 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-03 18:45:01,233 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:45:01,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-03 18:45:01,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:45:01,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:01,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:45:01,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:01,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:45:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:45:04,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:04,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:45:04,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:45:04,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:45:04,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:04,801 INFO L192 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 [2018-12-03 18:45:04,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:45:04,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:45:04,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:45:04,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:45:04,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:45:04,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:45:04,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:45:04,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:45:04,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:45:10,882 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 [2018-12-03 18:45:10,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:45:10,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:45:10,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:45:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:45:11,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:45:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:45:21,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:45:21,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2018-12-03 18:45:21,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:45:21,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-12-03 18:45:21,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-12-03 18:45:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 18:45:21,320 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2018-12-03 18:45:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:45:29,250 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-12-03 18:45:29,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:45:29,250 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2018-12-03 18:45:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:45:29,251 INFO L225 Difference]: With dead ends: 134 [2018-12-03 18:45:29,251 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 18:45:29,253 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 [2018-12-03 18:45:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 18:45:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-03 18:45:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 18:45:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-03 18:45:29,260 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-03 18:45:29,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:45:29,260 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-03 18:45:29,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-12-03 18:45:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-03 18:45:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 18:45:29,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:45:29,261 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-03 18:45:29,261 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:45:29,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:45:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-03 18:45:29,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:45:29,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:29,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:45:29,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:45:29,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:45:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:29,535 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 18:45:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:45:33,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:33,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:45:33,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:45:33,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:45:33,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:45:33,176 INFO L192 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 [2018-12-03 18:45:33,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:45:33,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:45:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:45:33,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:45:33,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:45:33,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:45:33,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:45:33,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:45:39,377 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 [2018-12-03 18:45:39,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:45:39,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:45:39,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:45:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:45:39,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:45:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:45:50,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:45:50,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2018-12-03 18:45:50,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:45:50,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-12-03 18:45:50,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-12-03 18:45:50,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 18:45:50,224 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2018-12-03 18:46:00,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:46:00,516 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-12-03 18:46:00,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:46:00,517 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2018-12-03 18:46:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:46:00,518 INFO L225 Difference]: With dead ends: 136 [2018-12-03 18:46:00,518 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 18:46:00,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 18:46:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 18:46:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-12-03 18:46:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 18:46:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-03 18:46:00,526 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-03 18:46:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:46:00,526 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-03 18:46:00,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-12-03 18:46:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-03 18:46:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 18:46:00,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:46:00,527 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-03 18:46:00,527 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:46:00,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:46:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-03 18:46:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:46:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:46:00,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:46:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:46:00,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:46:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:46:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:46:04,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:46:04,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:46:04,356 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:46:04,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:46:04,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:46:04,356 INFO L192 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 [2018-12-03 18:46:04,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:46:04,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:46:04,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 18:46:04,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:46:04,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:46:04,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 [2018-12-03 18:46:04,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:46:04,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:46:04,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:46:11,390 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 [2018-12-03 18:46:11,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:46:11,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:46:11,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:46:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:46:11,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:46:22,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:46:23,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:46:23,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2018-12-03 18:46:23,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:46:23,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-03 18:46:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-03 18:46:23,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2018-12-03 18:46:23,003 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2018-12-03 18:46:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:46:30,093 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-12-03 18:46:30,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 18:46:30,093 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2018-12-03 18:46:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:46:30,094 INFO L225 Difference]: With dead ends: 138 [2018-12-03 18:46:30,094 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 18:46:30,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2018-12-03 18:46:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 18:46:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-03 18:46:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 18:46:30,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-03 18:46:30,102 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-03 18:46:30,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:46:30,102 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-03 18:46:30,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-03 18:46:30,103 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-03 18:46:30,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 18:46:30,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:46:30,103 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-03 18:46:30,103 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:46:30,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:46:30,104 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-03 18:46:30,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:46:30,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:46:30,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:46:30,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:46:30,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:46:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:46:34,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:46:34,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:46:34,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:46:34,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:46:34,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:46:34,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:46:34,060 INFO L192 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 [2018-12-03 18:46:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:46:34,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:46:34,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:46:34,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:46:34,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:46:34,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 18:46:34,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:46:34,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:46:34,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 18:46:40,607 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 [2018-12-03 18:46:40,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 18:46:40,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 18:46:40,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 18:46:40,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:46:40,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:46:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:46:51,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:46:51,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2018-12-03 18:46:51,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:46:51,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-12-03 18:46:51,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-12-03 18:46:51,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 18:46:51,903 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states.