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/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:57:02,675 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:57:02,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:57:02,689 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:57:02,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:57:02,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:57:02,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:57:02,694 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:57:02,696 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:57:02,697 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:57:02,698 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:57:02,698 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:57:02,699 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:57:02,700 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:57:02,701 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:57:02,702 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:57:02,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:57:02,705 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:57:02,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:57:02,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:57:02,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:57:02,712 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:57:02,715 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:57:02,715 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:57:02,715 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:57:02,716 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:57:02,717 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:57:02,718 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:57:02,719 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:57:02,720 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:57:02,720 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:57:02,721 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:57:02,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:57:02,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:57:02,723 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:57:02,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:57:02,724 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-04 11:57:02,738 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:57:02,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:57:02,742 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:57:02,742 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:57:02,743 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:57:02,743 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:57:02,743 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:57:02,743 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:57:02,743 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:57:02,744 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-04 11:57:02,744 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-04 11:57:02,744 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:57:02,744 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:57:02,744 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:57:02,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:57:02,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:57:02,746 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:57:02,746 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:57:02,746 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:57:02,747 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:57:02,747 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:57:02,747 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:57:02,747 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:57:02,747 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:57:02,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:57:02,750 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:57:02,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:57:02,750 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:57:02,750 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:57:02,750 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:57:02,751 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:57:02,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:57:02,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:57:02,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:57:02,752 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:57:02,752 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:57:02,752 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:57:02,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:57:02,752 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:57:02,753 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:57:02,798 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:57:02,812 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:57:02,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:57:02,818 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:57:02,819 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:57:02,820 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2018-12-04 11:57:02,820 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2018-12-04 11:57:02,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:57:02,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:57:02,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:02,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:57:02,873 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:57:02,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:02,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:57:02,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:57:02,920 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:57:02,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:57:02,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:57:02,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:57:02,946 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:57:02,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (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-04 11:57:03,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:57:03,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:57:03,258 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:57:03,258 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-04 11:57:03,259 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:03 BoogieIcfgContainer [2018-12-04 11:57:03,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:57:03,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:57:03,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:57:03,266 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:57:03,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/2) ... [2018-12-04 11:57:03,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35189dfe and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:57:03, skipping insertion in model container [2018-12-04 11:57:03,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:03" (2/2) ... [2018-12-04 11:57:03,270 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2018-12-04 11:57:03,280 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:57:03,287 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:57:03,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:57:03,333 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:57:03,333 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:57:03,333 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:57:03,334 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:57:03,334 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:57:03,334 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:57:03,334 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:57:03,334 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:57:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-04 11:57:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-04 11:57:03,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-04 11:57:03,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,368 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-04 11:57:03,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:03,506 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-04 11:57:03,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:57:03,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:57:03,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:57:03,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:57:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:57:03,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:57:03,529 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-04 11:57:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:03,569 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-04 11:57:03,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:57:03,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-04 11:57:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:03,583 INFO L225 Difference]: With dead ends: 9 [2018-12-04 11:57:03,583 INFO L226 Difference]: Without dead ends: 5 [2018-12-04 11:57:03,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:57:03,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-04 11:57:03,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-04 11:57:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-04 11:57:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-04 11:57:03,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-04 11:57:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:03,624 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-04 11:57:03,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:57:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-04 11:57:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:57:03,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,625 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:57:03,625 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,626 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-04 11:57:03,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:03,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:03,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:03,798 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-04 11:57:03,800 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-04 11:57:03,879 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 11:57:03,879 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:57:08,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:57:08,499 INFO L272 AbstractInterpreter]: Visited 4 different actions 20 times. Merged at 1 different actions 8 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-04 11:57:08,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:08,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:57:08,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:08,519 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-04 11:57:08,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:08,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:08,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:08,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:08,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:08,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-04 11:57:08,823 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:08,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:57:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:57:08,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:57:08,825 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-04 11:57:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:08,908 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-04 11:57:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:57:08,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-04 11:57:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:08,910 INFO L225 Difference]: With dead ends: 8 [2018-12-04 11:57:08,910 INFO L226 Difference]: Without dead ends: 6 [2018-12-04 11:57:08,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:57:08,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-04 11:57:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-04 11:57:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-04 11:57:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-04 11:57:08,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-04 11:57:08,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:08,915 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-04 11:57:08,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:57:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-04 11:57:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-04 11:57:08,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:08,916 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-04 11:57:08,916 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:08,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-04 11:57:08,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:08,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:08,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:08,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:08,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:08,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:08,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:08,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:08,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:08,994 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-04 11:57:09,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:09,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:09,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:57:09,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:09,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:09,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-04 11:57:09,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:09,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:57:09,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:57:09,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:57:09,129 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-04 11:57:09,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:09,162 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-04 11:57:09,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:57:09,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-04 11:57:09,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:09,165 INFO L225 Difference]: With dead ends: 9 [2018-12-04 11:57:09,165 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:57:09,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:57:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:57:09,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:57:09,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:57:09,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-04 11:57:09,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-04 11:57:09,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:09,168 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-04 11:57:09,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:57:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-04 11:57:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:57:09,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:09,169 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-04 11:57:09,170 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:09,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:09,170 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-04 11:57:09,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:09,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:09,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:09,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:09,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:09,319 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-04 11:57:09,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:09,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:09,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:09,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:09,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:09,320 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-04 11:57:09,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:09,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:09,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:09,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:09,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:09,345 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-04 11:57:09,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:09,486 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-04 11:57:09,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:09,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-04 11:57:09,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:09,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-04 11:57:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-04 11:57:09,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:57:09,506 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-04 11:57:09,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:09,521 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-04 11:57:09,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:57:09,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-04 11:57:09,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:09,523 INFO L225 Difference]: With dead ends: 10 [2018-12-04 11:57:09,523 INFO L226 Difference]: Without dead ends: 8 [2018-12-04 11:57:09,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:57:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-04 11:57:09,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-04 11:57:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-04 11:57:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-04 11:57:09,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-04 11:57:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:09,527 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-04 11:57:09,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-04 11:57:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-04 11:57:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-04 11:57:09,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:09,528 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-04 11:57:09,528 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:09,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:09,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-04 11:57:09,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:09,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:09,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:09,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:09,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:09,689 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:09,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:09,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:09,689 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-04 11:57:09,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:09,697 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:09,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:09,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-04 11:57:09,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:09,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:57:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:57:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:57:09,938 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-04 11:57:09,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:09,961 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-04 11:57:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:57:09,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-04 11:57:09,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:09,962 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:57:09,962 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:57:09,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:57:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:57:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-04 11:57:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:57:09,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-04 11:57:09,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-04 11:57:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:09,967 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-04 11:57:09,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:57:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-04 11:57:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:57:09,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:09,968 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-04 11:57:09,968 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:09,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-04 11:57:09,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:09,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:09,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:09,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:09,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:10,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:10,136 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:10,136 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:10,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:10,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:10,137 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-04 11:57:10,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:10,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:10,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:57:10,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:10,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:10,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:10,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:10,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-04 11:57:10,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:10,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 11:57:10,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 11:57:10,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:57:10,972 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-04 11:57:11,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:11,065 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-04 11:57:11,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:57:11,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-04 11:57:11,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:11,066 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:57:11,067 INFO L226 Difference]: Without dead ends: 10 [2018-12-04 11:57:11,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:57:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-04 11:57:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-04 11:57:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-04 11:57:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-04 11:57:11,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-04 11:57:11,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:11,070 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-04 11:57:11,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 11:57:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-04 11:57:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 11:57:11,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:11,070 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-04 11:57:11,071 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:11,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:11,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-04 11:57:11,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:11,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:11,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:11,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:11,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:11,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:11,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:11,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:11,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:11,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 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-04 11:57:11,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:11,185 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:11,194 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:11,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:11,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:11,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-04 11:57:11,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:11,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-04 11:57:11,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-04 11:57:11,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:57:11,423 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-04 11:57:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:11,459 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-04 11:57:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:57:11,460 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-04 11:57:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:11,461 INFO L225 Difference]: With dead ends: 13 [2018-12-04 11:57:11,461 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:57:11,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:57:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:57:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:57:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:57:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-04 11:57:11,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-04 11:57:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:11,465 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-04 11:57:11,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-04 11:57:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-04 11:57:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:57:11,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:11,465 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-04 11:57:11,466 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:11,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:11,466 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-04 11:57:11,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:11,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:11,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:11,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:11,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:11,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:11,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:11,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:11,568 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-04 11:57:11,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:11,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:11,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:11,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:11,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-04 11:57:11,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:11,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:57:11,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:57:11,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:57:11,822 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-04 11:57:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:11,856 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-04 11:57:11,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:57:11,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-04 11:57:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:11,860 INFO L225 Difference]: With dead ends: 14 [2018-12-04 11:57:11,860 INFO L226 Difference]: Without dead ends: 12 [2018-12-04 11:57:11,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:57:11,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-04 11:57:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-04 11:57:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-04 11:57:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-04 11:57:11,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-04 11:57:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:11,864 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-04 11:57:11,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:57:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-04 11:57:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-04 11:57:11,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:11,864 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-04 11:57:11,865 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:11,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-04 11:57:11,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:11,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:11,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:11,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:11,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:12,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:12,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:12,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:12,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:12,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:12,112 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-04 11:57:12,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:12,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:12,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-04 11:57:12,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:12,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:12,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:12,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-04 11:57:12,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:12,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:57:12,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:57:12,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:57:12,328 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-04 11:57:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:12,347 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-04 11:57:12,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:57:12,348 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-04 11:57:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:12,348 INFO L225 Difference]: With dead ends: 15 [2018-12-04 11:57:12,348 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:57:12,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:57:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:57:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-04 11:57:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-04 11:57:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-04 11:57:12,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-04 11:57:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:12,353 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-04 11:57:12,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:57:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-04 11:57:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-04 11:57:12,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:12,353 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-04 11:57:12,354 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:12,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-04 11:57:12,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:12,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:12,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:12,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:12,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:12,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:12,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:12,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:12,605 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-04 11:57:12,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:12,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:12,631 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:12,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:12,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:12,639 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:12,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:12,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:12,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-04 11:57:12,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:12,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-04 11:57:12,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-04 11:57:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:57:12,837 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-04 11:57:12,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:12,863 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-04 11:57:12,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 11:57:12,864 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-04 11:57:12,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:12,864 INFO L225 Difference]: With dead ends: 16 [2018-12-04 11:57:12,865 INFO L226 Difference]: Without dead ends: 14 [2018-12-04 11:57:12,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:57:12,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-04 11:57:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-04 11:57:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-04 11:57:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-04 11:57:12,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-04 11:57:12,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:12,869 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-04 11:57:12,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-04 11:57:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-04 11:57:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-04 11:57:12,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:12,869 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-04 11:57:12,870 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:12,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:12,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-04 11:57:12,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:12,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:12,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:12,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:13,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:13,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:13,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:13,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:13,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:13,005 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-04 11:57:13,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:13,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:13,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:13,035 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:13,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:13,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:13,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-04 11:57:13,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:13,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-04 11:57:13,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-04 11:57:13,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:57:13,273 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-04 11:57:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:13,296 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-04 11:57:13,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-04 11:57:13,297 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-04 11:57:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:13,298 INFO L225 Difference]: With dead ends: 17 [2018-12-04 11:57:13,298 INFO L226 Difference]: Without dead ends: 15 [2018-12-04 11:57:13,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:57:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-04 11:57:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-04 11:57:13,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-04 11:57:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-04 11:57:13,303 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-04 11:57:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:13,303 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-04 11:57:13,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-04 11:57:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-04 11:57:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-04 11:57:13,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:13,304 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-04 11:57:13,304 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:13,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:13,304 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-04 11:57:13,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:13,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:13,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:13,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:13,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:13,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:13,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:13,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:13,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:13,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:13,497 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-04 11:57:13,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:13,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:13,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-04 11:57:13,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:13,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:13,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:13,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:13,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-04 11:57:13,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:13,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 11:57:13,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 11:57:13,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:57:13,853 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-04 11:57:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:13,895 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-04 11:57:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-04 11:57:13,896 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-04 11:57:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:13,897 INFO L225 Difference]: With dead ends: 18 [2018-12-04 11:57:13,897 INFO L226 Difference]: Without dead ends: 16 [2018-12-04 11:57:13,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:57:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-04 11:57:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-04 11:57:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-04 11:57:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-04 11:57:13,901 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-04 11:57:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:13,902 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-04 11:57:13,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 11:57:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-04 11:57:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-04 11:57:13,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:13,902 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-04 11:57:13,903 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:13,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-04 11:57:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:13,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:13,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:14,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:14,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:14,052 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:14,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:14,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:14,053 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-04 11:57:14,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:14,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:14,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:14,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:14,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:14,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:14,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:14,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-04 11:57:14,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:14,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-04 11:57:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-04 11:57:14,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:57:14,381 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-04 11:57:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:14,461 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-04 11:57:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:57:14,462 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-04 11:57:14,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:14,462 INFO L225 Difference]: With dead ends: 19 [2018-12-04 11:57:14,463 INFO L226 Difference]: Without dead ends: 17 [2018-12-04 11:57:14,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:57:14,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-04 11:57:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-04 11:57:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 11:57:14,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-04 11:57:14,469 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-04 11:57:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:14,469 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-04 11:57:14,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-04 11:57:14,469 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-04 11:57:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 11:57:14,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:14,470 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-04 11:57:14,470 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:14,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:14,471 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-04 11:57:14,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:14,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:14,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:14,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:14,472 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:14,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:14,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:14,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:14,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:14,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:14,665 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-04 11:57:14,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:14,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:14,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:14,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:15,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-04 11:57:15,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:15,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-04 11:57:15,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-04 11:57:15,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:57:15,136 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-04 11:57:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:15,175 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-04 11:57:15,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 11:57:15,183 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-04 11:57:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:15,184 INFO L225 Difference]: With dead ends: 20 [2018-12-04 11:57:15,184 INFO L226 Difference]: Without dead ends: 18 [2018-12-04 11:57:15,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:57:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-04 11:57:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-04 11:57:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-04 11:57:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-04 11:57:15,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-04 11:57:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:15,190 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-04 11:57:15,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-04 11:57:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-04 11:57:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-04 11:57:15,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:15,191 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-04 11:57:15,191 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:15,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:15,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-04 11:57:15,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:15,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:15,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:15,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:15,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:15,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:15,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:15,658 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:15,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:15,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:15,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 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-04 11:57:15,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:15,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:15,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 11:57:15,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:15,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:15,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:16,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:16,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-04 11:57:16,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:16,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:57:16,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:57:16,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:57:16,158 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-04 11:57:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:16,196 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-04 11:57:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-04 11:57:16,197 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-04 11:57:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:16,198 INFO L225 Difference]: With dead ends: 21 [2018-12-04 11:57:16,198 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:57:16,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:57:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:57:16,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-04 11:57:16,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:57:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-04 11:57:16,202 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-04 11:57:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:16,202 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-04 11:57:16,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:57:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-04 11:57:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-04 11:57:16,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:16,203 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-04 11:57:16,204 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:16,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-04 11:57:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:16,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:16,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:16,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:16,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:16,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:16,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:16,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:16,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:16,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:16,508 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-04 11:57:16,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:16,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:16,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:16,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:16,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:16,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:17,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:17,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-04 11:57:17,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:17,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-04 11:57:17,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-04 11:57:17,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:57:17,307 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-04 11:57:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:17,342 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-04 11:57:17,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 11:57:17,342 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-04 11:57:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:17,343 INFO L225 Difference]: With dead ends: 22 [2018-12-04 11:57:17,344 INFO L226 Difference]: Without dead ends: 20 [2018-12-04 11:57:17,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:57:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-04 11:57:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-04 11:57:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-04 11:57:17,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-04 11:57:17,349 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-04 11:57:17,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:17,349 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-04 11:57:17,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-04 11:57:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-04 11:57:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-04 11:57:17,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:17,350 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-04 11:57:17,350 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:17,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-04 11:57:17,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:17,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:17,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:18,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:18,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:18,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:18,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:18,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:18,122 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-04 11:57:18,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:18,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:18,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:18,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:18,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:18,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-04 11:57:18,867 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-04 11:57:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-04 11:57:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:57:18,868 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-04 11:57:18,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:18,892 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-04 11:57:18,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:57:18,893 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-04 11:57:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:18,894 INFO L225 Difference]: With dead ends: 23 [2018-12-04 11:57:18,894 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:57:18,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:57:18,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:57:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-04 11:57:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:57:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-04 11:57:18,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-04 11:57:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:18,898 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-04 11:57:18,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-04 11:57:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-04 11:57:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:57:18,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:18,899 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-04 11:57:18,899 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:18,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:18,900 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-04 11:57:18,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:18,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:18,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:19,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,099 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:19,099 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:19,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:19,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,099 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-04 11:57:19,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:19,110 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:19,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-04 11:57:19,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:19,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:19,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:19,979 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:19,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:19,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-04 11:57:19,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:19,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-04 11:57:19,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-04 11:57:20,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:57:20,000 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-04 11:57:20,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:20,033 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-04 11:57:20,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:57:20,034 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-04 11:57:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:20,034 INFO L225 Difference]: With dead ends: 24 [2018-12-04 11:57:20,034 INFO L226 Difference]: Without dead ends: 22 [2018-12-04 11:57:20,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:57:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-04 11:57:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-04 11:57:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-04 11:57:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-04 11:57:20,043 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-04 11:57:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:20,043 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-04 11:57:20,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-04 11:57:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-04 11:57:20,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-04 11:57:20,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:20,047 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-04 11:57:20,047 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:20,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:20,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-04 11:57:20,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:20,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:20,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:20,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:20,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:20,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:20,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:20,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:20,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:20,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:20,804 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-04 11:57:20,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:20,815 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:20,856 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:20,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:20,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:20,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:21,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:21,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-04 11:57:21,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:21,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-04 11:57:21,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-04 11:57:21,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:57:21,392 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-04 11:57:21,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:21,430 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-04 11:57:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-04 11:57:21,431 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-04 11:57:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:21,431 INFO L225 Difference]: With dead ends: 25 [2018-12-04 11:57:21,435 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:57:21,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:57:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:57:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-04 11:57:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-04 11:57:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-04 11:57:21,441 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-04 11:57:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:21,442 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-04 11:57:21,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-04 11:57:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-04 11:57:21,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-04 11:57:21,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:21,443 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-04 11:57:21,443 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:21,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:21,444 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-04 11:57:21,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:21,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:21,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:21,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:21,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:21,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:21,751 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:21,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:21,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:21,751 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-04 11:57:21,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:21,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:21,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:21,782 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:21,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:22,607 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:22,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:22,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-04 11:57:22,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:22,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-04 11:57:22,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-04 11:57:22,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:57:22,631 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-04 11:57:22,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:22,695 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-04 11:57:22,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 11:57:22,696 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-04 11:57:22,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:22,697 INFO L225 Difference]: With dead ends: 26 [2018-12-04 11:57:22,697 INFO L226 Difference]: Without dead ends: 24 [2018-12-04 11:57:22,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:57:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-04 11:57:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-04 11:57:22,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-04 11:57:22,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-04 11:57:22,701 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-04 11:57:22,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:22,701 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-04 11:57:22,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-04 11:57:22,701 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-04 11:57:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-04 11:57:22,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:22,702 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-04 11:57:22,702 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:22,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:22,702 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-04 11:57:22,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:22,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:22,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:22,978 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-04 11:57:22,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:22,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:22,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:22,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:22,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:22,979 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-04 11:57:22,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:22,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:23,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 11:57:23,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:23,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:23,031 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-04 11:57:23,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:23,809 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-04 11:57:23,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:23,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-04 11:57:23,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:23,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:57:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:57:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:57:23,838 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-04 11:57:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:23,902 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-04 11:57:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-04 11:57:23,903 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-04 11:57:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:23,904 INFO L225 Difference]: With dead ends: 27 [2018-12-04 11:57:23,904 INFO L226 Difference]: Without dead ends: 25 [2018-12-04 11:57:23,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:57:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-04 11:57:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-04 11:57:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-04 11:57:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-04 11:57:23,909 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-04 11:57:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:23,909 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-04 11:57:23,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:57:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-04 11:57:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-04 11:57:23,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:23,910 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-04 11:57:23,910 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:23,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-04 11:57:23,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:23,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:23,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:23,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:24,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:24,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:24,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:24,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:24,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:24,200 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-04 11:57:24,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:24,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:24,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:24,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:24,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:24,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:24,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:24,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-04 11:57:24,905 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:24,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-04 11:57:24,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-04 11:57:24,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:57:24,906 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-04 11:57:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:25,012 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-04 11:57:25,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:57:25,015 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-04 11:57:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:25,016 INFO L225 Difference]: With dead ends: 28 [2018-12-04 11:57:25,016 INFO L226 Difference]: Without dead ends: 26 [2018-12-04 11:57:25,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:57:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-04 11:57:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-04 11:57:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-04 11:57:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-04 11:57:25,020 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-04 11:57:25,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:25,020 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-04 11:57:25,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-04 11:57:25,020 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-04 11:57:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-04 11:57:25,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:25,021 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-04 11:57:25,021 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:25,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:25,021 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-04 11:57:25,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:25,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:25,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:25,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:25,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:25,685 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:25,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:25,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:25,686 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:25,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:25,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:25,686 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-04 11:57:25,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:25,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:25,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:25,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:26,308 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:26,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:26,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-04 11:57:26,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:26,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-04 11:57:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-04 11:57:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:57:26,330 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-04 11:57:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:26,367 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-04 11:57:26,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-04 11:57:26,368 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-04 11:57:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:26,368 INFO L225 Difference]: With dead ends: 29 [2018-12-04 11:57:26,368 INFO L226 Difference]: Without dead ends: 27 [2018-12-04 11:57:26,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:57:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-04 11:57:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-04 11:57:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-04 11:57:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-04 11:57:26,372 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-04 11:57:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:26,372 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-04 11:57:26,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-04 11:57:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-04 11:57:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-04 11:57:26,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:26,373 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-04 11:57:26,373 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:26,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:26,374 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-04 11:57:26,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:26,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:26,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:26,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:26,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:26,776 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:26,776 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:26,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:26,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:26,776 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-04 11:57:26,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:26,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:26,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 11:57:26,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:26,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:26,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:27,934 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:27,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:27,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-04 11:57:27,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:27,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 11:57:27,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 11:57:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:57:27,955 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-04 11:57:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:28,096 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-04 11:57:28,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:57:28,097 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-04 11:57:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:28,097 INFO L225 Difference]: With dead ends: 30 [2018-12-04 11:57:28,097 INFO L226 Difference]: Without dead ends: 28 [2018-12-04 11:57:28,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:57:28,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-04 11:57:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-04 11:57:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-04 11:57:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-04 11:57:28,102 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-04 11:57:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:28,102 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-04 11:57:28,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 11:57:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-04 11:57:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-04 11:57:28,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:28,103 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-04 11:57:28,103 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:28,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-04 11:57:28,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:28,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:28,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:28,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:28,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:28,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:28,517 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:28,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:28,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:28,517 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-04 11:57:28,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:28,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:28,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:28,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:28,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:28,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:29,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-04 11:57:29,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:29,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:57:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:57:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:57:29,354 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-04 11:57:29,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:29,410 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-04 11:57:29,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:57:29,410 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-04 11:57:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:29,411 INFO L225 Difference]: With dead ends: 31 [2018-12-04 11:57:29,411 INFO L226 Difference]: Without dead ends: 29 [2018-12-04 11:57:29,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:57:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-04 11:57:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-04 11:57:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-04 11:57:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-04 11:57:29,415 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-04 11:57:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:29,415 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-04 11:57:29,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:57:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-04 11:57:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-04 11:57:29,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:29,416 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-04 11:57:29,417 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:29,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-04 11:57:29,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:29,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:29,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:29,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:29,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:29,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:29,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:29,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:29,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:29,760 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-04 11:57:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:29,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:29,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:29,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:30,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:30,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-04 11:57:30,632 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:30,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-04 11:57:30,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-04 11:57:30,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:57:30,633 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-04 11:57:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:30,695 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-04 11:57:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-04 11:57:30,699 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-04 11:57:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:30,700 INFO L225 Difference]: With dead ends: 32 [2018-12-04 11:57:30,700 INFO L226 Difference]: Without dead ends: 30 [2018-12-04 11:57:30,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:57:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-04 11:57:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-04 11:57:30,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-04 11:57:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-04 11:57:30,704 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-04 11:57:30,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:30,704 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-04 11:57:30,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-04 11:57:30,704 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-04 11:57:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-04 11:57:30,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:30,705 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-04 11:57:30,705 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:30,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-04 11:57:30,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:30,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:31,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:31,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:31,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:31,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:31,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:31,268 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-04 11:57:31,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:31,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:31,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-04 11:57:31,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:31,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:31,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:33,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:33,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-04 11:57:33,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:33,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:57:33,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:57:33,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:57:33,092 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-04 11:57:33,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:33,369 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-04 11:57:33,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-04 11:57:33,370 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-04 11:57:33,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:33,370 INFO L225 Difference]: With dead ends: 33 [2018-12-04 11:57:33,370 INFO L226 Difference]: Without dead ends: 31 [2018-12-04 11:57:33,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:57:33,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-04 11:57:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-04 11:57:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 11:57:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-04 11:57:33,374 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-04 11:57:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:33,375 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-04 11:57:33,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:57:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-04 11:57:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 11:57:33,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:33,375 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-04 11:57:33,376 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:33,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:33,376 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-04 11:57:33,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:33,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:33,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:33,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:33,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:34,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:34,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:34,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:34,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:34,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:34,650 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-04 11:57:34,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:34,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:34,683 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:34,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:34,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:34,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:35,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:35,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-04 11:57:35,589 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:35,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-04 11:57:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-04 11:57:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:57:35,591 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-04 11:57:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:35,691 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-04 11:57:35,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 11:57:35,692 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-04 11:57:35,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:35,693 INFO L225 Difference]: With dead ends: 34 [2018-12-04 11:57:35,693 INFO L226 Difference]: Without dead ends: 32 [2018-12-04 11:57:35,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:57:35,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-04 11:57:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-04 11:57:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-04 11:57:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-04 11:57:35,698 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-04 11:57:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:35,699 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-04 11:57:35,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-04 11:57:35,699 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-04 11:57:35,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-04 11:57:35,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:35,700 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-04 11:57:35,700 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:35,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-04 11:57:35,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:35,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:35,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:35,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:35,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:36,387 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:36,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:36,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:36,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:36,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:36,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:36,388 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-04 11:57:36,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:36,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:36,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:36,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:37,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:37,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-04 11:57:37,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:37,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-04 11:57:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-04 11:57:37,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:57:37,994 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-04 11:57:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:38,074 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-04 11:57:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:57:38,074 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-04 11:57:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:38,075 INFO L225 Difference]: With dead ends: 35 [2018-12-04 11:57:38,075 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:57:38,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:57:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:57:38,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-04 11:57:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-04 11:57:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-04 11:57:38,079 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-04 11:57:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:38,080 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-04 11:57:38,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-04 11:57:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-04 11:57:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-04 11:57:38,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:38,081 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-04 11:57:38,081 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:38,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-04 11:57:38,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:38,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:38,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:38,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:38,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:38,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:38,608 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-04 11:57:38,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:38,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:38,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 11:57:38,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:38,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:38,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:39,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:39,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-04 11:57:39,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:39,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 11:57:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 11:57:39,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:57:39,684 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-04 11:57:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:39,740 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-04 11:57:39,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:57:39,741 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-04 11:57:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:39,742 INFO L225 Difference]: With dead ends: 36 [2018-12-04 11:57:39,742 INFO L226 Difference]: Without dead ends: 34 [2018-12-04 11:57:39,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:57:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-04 11:57:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-04 11:57:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-04 11:57:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-04 11:57:39,745 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-04 11:57:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:39,746 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-04 11:57:39,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 11:57:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-04 11:57:39,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-04 11:57:39,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:39,746 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-04 11:57:39,746 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:39,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:39,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-04 11:57:39,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:39,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:39,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:39,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:39,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:40,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:40,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:40,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:40,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:40,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:40,156 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-04 11:57:40,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:40,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:40,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:40,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:40,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:40,199 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:40,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:41,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:41,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-04 11:57:41,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:41,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-04 11:57:41,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-04 11:57:41,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:57:41,272 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-04 11:57:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:41,358 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-04 11:57:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-04 11:57:41,358 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-04 11:57:41,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:41,358 INFO L225 Difference]: With dead ends: 37 [2018-12-04 11:57:41,359 INFO L226 Difference]: Without dead ends: 35 [2018-12-04 11:57:41,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:57:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-04 11:57:41,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-04 11:57:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 11:57:41,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-04 11:57:41,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-04 11:57:41,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:41,363 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-04 11:57:41,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-04 11:57:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-04 11:57:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 11:57:41,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:41,363 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-04 11:57:41,363 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:41,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:41,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-04 11:57:41,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:41,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:41,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:41,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:41,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:41,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:41,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:41,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:41,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:41,825 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-04 11:57:41,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:41,835 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:41,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:41,866 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:41,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:43,352 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:43,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:43,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-04 11:57:43,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:43,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-04 11:57:43,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-04 11:57:43,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:57:43,372 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-04 11:57:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:43,438 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-04 11:57:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 11:57:43,439 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-04 11:57:43,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:43,440 INFO L225 Difference]: With dead ends: 38 [2018-12-04 11:57:43,440 INFO L226 Difference]: Without dead ends: 36 [2018-12-04 11:57:43,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:57:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-04 11:57:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-04 11:57:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-04 11:57:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-04 11:57:43,445 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-04 11:57:43,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:43,445 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-04 11:57:43,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-04 11:57:43,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-04 11:57:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-04 11:57:43,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:43,446 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-04 11:57:43,446 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:43,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:43,446 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-04 11:57:43,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:43,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:43,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:43,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:43,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:43,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:43,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:43,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:43,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:43,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:43,949 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-04 11:57:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:43,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:44,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-04 11:57:44,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:44,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:44,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:45,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:45,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-04 11:57:45,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:45,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:57:45,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:57:45,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:57:45,258 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-04 11:57:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:45,324 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-04 11:57:45,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:57:45,325 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-04 11:57:45,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:45,326 INFO L225 Difference]: With dead ends: 39 [2018-12-04 11:57:45,326 INFO L226 Difference]: Without dead ends: 37 [2018-12-04 11:57:45,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:57:45,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-04 11:57:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-04 11:57:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-04 11:57:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-04 11:57:45,330 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-04 11:57:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:45,330 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-04 11:57:45,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:57:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-04 11:57:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-04 11:57:45,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:45,331 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-04 11:57:45,331 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:45,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-04 11:57:45,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:45,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:45,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:45,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:45,826 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:45,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:45,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:45,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:45,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:45,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:45,827 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-04 11:57:45,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:45,835 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:45,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:45,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:45,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:45,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:47,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:47,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-04 11:57:47,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:47,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-04 11:57:47,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-04 11:57:47,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:57:47,256 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-04 11:57:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:47,362 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-04 11:57:47,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 11:57:47,362 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-04 11:57:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:47,363 INFO L225 Difference]: With dead ends: 40 [2018-12-04 11:57:47,363 INFO L226 Difference]: Without dead ends: 38 [2018-12-04 11:57:47,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:57:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-04 11:57:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-04 11:57:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-04 11:57:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-04 11:57:47,367 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-04 11:57:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:47,367 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-04 11:57:47,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-04 11:57:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-04 11:57:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-04 11:57:47,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:47,368 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-04 11:57:47,368 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:47,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-04 11:57:47,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:47,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:47,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:48,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:48,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:48,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:48,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:48,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:48,285 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-04 11:57:48,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:48,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:48,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:48,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:50,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:50,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-04 11:57:50,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:50,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-04 11:57:50,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-04 11:57:50,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:57:50,256 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-04 11:57:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:50,326 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-04 11:57:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:57:50,326 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-04 11:57:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:50,327 INFO L225 Difference]: With dead ends: 41 [2018-12-04 11:57:50,327 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:57:50,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:57:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:57:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-04 11:57:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-04 11:57:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-04 11:57:50,330 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-04 11:57:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:50,330 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-04 11:57:50,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-04 11:57:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-04 11:57:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-04 11:57:50,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:50,331 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-04 11:57:50,331 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:50,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-04 11:57:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:50,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:50,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:50,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:50,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:50,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:50,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:50,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:50,911 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-04 11:57:50,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:50,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:50,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-04 11:57:50,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:51,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:51,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:52,471 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:52,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:52,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-04 11:57:52,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:52,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 11:57:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 11:57:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:57:52,492 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-04 11:57:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:52,544 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-04 11:57:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-04 11:57:52,544 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-04 11:57:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:52,545 INFO L225 Difference]: With dead ends: 42 [2018-12-04 11:57:52,545 INFO L226 Difference]: Without dead ends: 40 [2018-12-04 11:57:52,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:57:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-04 11:57:52,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-04 11:57:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-04 11:57:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-04 11:57:52,547 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-04 11:57:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:52,548 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-04 11:57:52,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 11:57:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-04 11:57:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-04 11:57:52,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:52,548 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-04 11:57:52,548 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:52,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-04 11:57:52,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:52,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:52,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:52,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:52,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:53,251 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:53,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:53,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:53,251 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:53,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:53,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:53,251 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-04 11:57:53,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:53,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:53,283 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:53,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:53,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:53,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:54,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:54,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-04 11:57:54,782 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:54,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-04 11:57:54,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-04 11:57:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:57:54,784 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-04 11:57:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:54,840 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-04 11:57:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:57:54,841 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-04 11:57:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:54,841 INFO L225 Difference]: With dead ends: 43 [2018-12-04 11:57:54,841 INFO L226 Difference]: Without dead ends: 41 [2018-12-04 11:57:54,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:57:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-04 11:57:54,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-04 11:57:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-04 11:57:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-04 11:57:54,844 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-04 11:57:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:54,844 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-04 11:57:54,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-04 11:57:54,845 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-04 11:57:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-04 11:57:54,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:54,845 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-04 11:57:54,845 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:54,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:54,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-04 11:57:54,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:54,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:54,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:54,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:54,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:55,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:55,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:55,495 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:55,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:55,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:55,496 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-04 11:57:55,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:55,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:55,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:55,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-04 11:57:57,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:57,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-04 11:57:57,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-04 11:57:57,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:57:57,083 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-04 11:57:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:57,151 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-04 11:57:57,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 11:57:57,151 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-04 11:57:57,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:57,152 INFO L225 Difference]: With dead ends: 44 [2018-12-04 11:57:57,152 INFO L226 Difference]: Without dead ends: 42 [2018-12-04 11:57:57,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:57:57,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-04 11:57:57,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-04 11:57:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-04 11:57:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-04 11:57:57,154 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-04 11:57:57,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:57,155 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-04 11:57:57,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-04 11:57:57,155 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-04 11:57:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-04 11:57:57,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:57,155 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-04 11:57:57,156 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:57,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-04 11:57:57,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:57,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:57,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:57,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:57,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:58,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:58,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:58,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:58,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:58,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:58,192 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-04 11:57:58,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:58,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:58,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 11:57:58,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:58,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:58,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:57:59,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:59,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-04 11:57:59,918 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:59,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:57:59,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:57:59,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:57:59,920 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-04 11:57:59,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:59,988 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-04 11:57:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-04 11:57:59,989 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-04 11:57:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:59,989 INFO L225 Difference]: With dead ends: 45 [2018-12-04 11:57:59,990 INFO L226 Difference]: Without dead ends: 43 [2018-12-04 11:57:59,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:57:59,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-04 11:57:59,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-04 11:57:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-04 11:57:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-04 11:57:59,993 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-04 11:57:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:59,993 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-04 11:57:59,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:57:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-04 11:57:59,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-04 11:57:59,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:59,994 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-04 11:57:59,994 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:59,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:59,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-04 11:57:59,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:59,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:59,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:59,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:00,653 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:00,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:00,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:00,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:00,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:00,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:00,654 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-04 11:58:00,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:00,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:00,699 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:00,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:00,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:00,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:02,540 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:02,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:02,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-04 11:58:02,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:02,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-04 11:58:02,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-04 11:58:02,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:58:02,560 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-04 11:58:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:02,639 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-04 11:58:02,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-04 11:58:02,639 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-04 11:58:02,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:02,640 INFO L225 Difference]: With dead ends: 46 [2018-12-04 11:58:02,640 INFO L226 Difference]: Without dead ends: 44 [2018-12-04 11:58:02,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:58:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-04 11:58:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-04 11:58:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-04 11:58:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-04 11:58:02,644 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-04 11:58:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:02,644 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-04 11:58:02,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-04 11:58:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-04 11:58:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-04 11:58:02,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:02,645 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-04 11:58:02,645 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:02,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:02,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-04 11:58:02,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:02,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:02,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:02,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:03,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:03,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:03,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:03,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:03,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:03,752 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-04 11:58:03,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:03,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:03,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:03,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:05,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:05,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-04 11:58:05,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:05,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-04 11:58:05,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-04 11:58:05,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:58:05,852 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-04 11:58:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:05,953 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-04 11:58:05,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-04 11:58:05,954 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-04 11:58:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:05,955 INFO L225 Difference]: With dead ends: 47 [2018-12-04 11:58:05,955 INFO L226 Difference]: Without dead ends: 45 [2018-12-04 11:58:05,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:58:05,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-04 11:58:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-04 11:58:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 11:58:05,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-04 11:58:05,957 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-04 11:58:05,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:05,957 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-04 11:58:05,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-04 11:58:05,957 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-04 11:58:05,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 11:58:05,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:05,958 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-04 11:58:05,958 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:05,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:05,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-04 11:58:05,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:05,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:05,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:05,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:05,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:06,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:06,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:06,716 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:06,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:06,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:06,717 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-04 11:58:06,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:06,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:06,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 11:58:06,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:06,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:06,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:09,083 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:09,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:09,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-04 11:58:09,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:09,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 11:58:09,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 11:58:09,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:58:09,104 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-04 11:58:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:09,188 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-04 11:58:09,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 11:58:09,188 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-04 11:58:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:09,189 INFO L225 Difference]: With dead ends: 48 [2018-12-04 11:58:09,189 INFO L226 Difference]: Without dead ends: 46 [2018-12-04 11:58:09,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:58:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-04 11:58:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-04 11:58:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-04 11:58:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-04 11:58:09,191 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-04 11:58:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:09,192 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-04 11:58:09,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 11:58:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-04 11:58:09,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-04 11:58:09,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:09,193 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-04 11:58:09,193 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:09,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:09,193 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-04 11:58:09,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:09,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:09,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:09,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:09,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:09,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:09,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:09,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:09,958 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-04 11:58:09,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:09,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:09,999 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:09,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:10,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:10,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:12,000 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:12,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:12,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-04 11:58:12,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:12,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-04 11:58:12,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-04 11:58:12,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:58:12,020 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-04 11:58:12,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:12,075 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-04 11:58:12,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-04 11:58:12,075 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-04 11:58:12,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:12,076 INFO L225 Difference]: With dead ends: 49 [2018-12-04 11:58:12,076 INFO L226 Difference]: Without dead ends: 47 [2018-12-04 11:58:12,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:58:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-04 11:58:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-04 11:58:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-04 11:58:12,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-04 11:58:12,080 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-04 11:58:12,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:12,080 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-04 11:58:12,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-04 11:58:12,080 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-04 11:58:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-04 11:58:12,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:12,080 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-04 11:58:12,081 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:12,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:12,081 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-04 11:58:12,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:12,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:12,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:12,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:13,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:13,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:13,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:13,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:13,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:13,058 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-04 11:58:13,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:13,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:13,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:13,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:15,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:15,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-04 11:58:15,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:15,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-04 11:58:15,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-04 11:58:15,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:58:15,475 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-04 11:58:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:15,550 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-04 11:58:15,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-04 11:58:15,551 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-04 11:58:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:15,551 INFO L225 Difference]: With dead ends: 50 [2018-12-04 11:58:15,552 INFO L226 Difference]: Without dead ends: 48 [2018-12-04 11:58:15,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:58:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-04 11:58:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-04 11:58:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-04 11:58:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-04 11:58:15,555 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-04 11:58:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:15,555 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-04 11:58:15,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-04 11:58:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-04 11:58:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-04 11:58:15,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:15,556 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-04 11:58:15,556 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:15,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:15,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-04 11:58:15,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:15,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:15,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:15,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:17,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:17,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:17,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:17,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:17,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:17,924 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-04 11:58:17,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:17,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:18,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-04 11:58:18,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:18,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:18,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:20,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:20,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-04 11:58:20,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:20,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:58:20,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:58:20,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:58:20,877 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-04 11:58:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:20,963 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-04 11:58:20,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 11:58:20,964 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-04 11:58:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:20,965 INFO L225 Difference]: With dead ends: 51 [2018-12-04 11:58:20,965 INFO L226 Difference]: Without dead ends: 49 [2018-12-04 11:58:20,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:58:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-04 11:58:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-04 11:58:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 11:58:20,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-04 11:58:20,968 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-04 11:58:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:20,969 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-04 11:58:20,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:58:20,969 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-04 11:58:20,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 11:58:20,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:20,970 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-04 11:58:20,970 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:20,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:20,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-04 11:58:20,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:20,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:20,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:20,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:20,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:21,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:21,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:21,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:21,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:21,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:21,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:21,845 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-04 11:58:21,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:21,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:21,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:21,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:21,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:21,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:21,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:24,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:24,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-04 11:58:24,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:24,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-04 11:58:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-04 11:58:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:58:24,375 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-04 11:58:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:24,596 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-04 11:58:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 11:58:24,596 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-04 11:58:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:24,597 INFO L225 Difference]: With dead ends: 52 [2018-12-04 11:58:24,597 INFO L226 Difference]: Without dead ends: 50 [2018-12-04 11:58:24,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:58:24,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-04 11:58:24,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-04 11:58:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-04 11:58:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-04 11:58:24,601 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-04 11:58:24,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:24,602 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-04 11:58:24,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-04 11:58:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-04 11:58:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-04 11:58:24,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:24,603 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-04 11:58:24,603 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:24,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:24,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-04 11:58:24,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:24,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:24,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:24,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:24,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:25,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:25,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:25,511 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:25,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:25,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:25,512 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-04 11:58:25,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:25,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:25,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:25,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:28,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:28,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-04 11:58:28,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:28,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-04 11:58:28,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-04 11:58:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:58:28,299 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-04 11:58:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:28,396 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-04 11:58:28,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-04 11:58:28,397 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-04 11:58:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:28,398 INFO L225 Difference]: With dead ends: 53 [2018-12-04 11:58:28,398 INFO L226 Difference]: Without dead ends: 51 [2018-12-04 11:58:28,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:58:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-04 11:58:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-04 11:58:28,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-04 11:58:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-04 11:58:28,400 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-04 11:58:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:28,401 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-04 11:58:28,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-04 11:58:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-04 11:58:28,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-04 11:58:28,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:28,402 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-04 11:58:28,402 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:28,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:28,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-04 11:58:28,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:28,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:28,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:28,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:28,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:29,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:29,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:29,684 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:29,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:29,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:29,684 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-04 11:58:29,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:29,692 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:29,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 11:58:29,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:29,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:29,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:32,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:32,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-04 11:58:32,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:32,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 11:58:32,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 11:58:32,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:58:32,273 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-04 11:58:32,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:32,335 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-04 11:58:32,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 11:58:32,335 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-04 11:58:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:32,336 INFO L225 Difference]: With dead ends: 54 [2018-12-04 11:58:32,336 INFO L226 Difference]: Without dead ends: 52 [2018-12-04 11:58:32,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:58:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-04 11:58:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-04 11:58:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-04 11:58:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-04 11:58:32,340 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-04 11:58:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:32,340 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-04 11:58:32,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 11:58:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-04 11:58:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-04 11:58:32,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:32,341 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-04 11:58:32,341 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:32,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-04 11:58:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:32,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:32,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:34,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:34,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:34,635 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:34,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:34,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:34,635 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-04 11:58:34,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:34,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:34,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:34,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:34,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:34,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:37,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:37,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-04 11:58:37,417 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:37,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-04 11:58:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-04 11:58:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:58:37,419 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-04 11:58:37,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:37,590 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-04 11:58:37,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-04 11:58:37,590 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-04 11:58:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:37,591 INFO L225 Difference]: With dead ends: 55 [2018-12-04 11:58:37,591 INFO L226 Difference]: Without dead ends: 53 [2018-12-04 11:58:37,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:58:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-04 11:58:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-04 11:58:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-04 11:58:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-04 11:58:37,595 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-04 11:58:37,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:37,596 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-04 11:58:37,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-04 11:58:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-04 11:58:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-04 11:58:37,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:37,596 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-04 11:58:37,596 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:37,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-04 11:58:37,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:37,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:37,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:37,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:37,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:38,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:38,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:38,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:38,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:38,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:38,607 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-04 11:58:38,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:38,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:38,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:38,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:41,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:41,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-04 11:58:41,531 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:41,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-04 11:58:41,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-04 11:58:41,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:58:41,532 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-04 11:58:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:41,596 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-04 11:58:41,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 11:58:41,597 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-04 11:58:41,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:41,597 INFO L225 Difference]: With dead ends: 56 [2018-12-04 11:58:41,598 INFO L226 Difference]: Without dead ends: 54 [2018-12-04 11:58:41,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:58:41,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-04 11:58:41,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-04 11:58:41,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-04 11:58:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-04 11:58:41,602 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-04 11:58:41,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:41,602 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-04 11:58:41,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-04 11:58:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-04 11:58:41,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-04 11:58:41,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:41,603 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-04 11:58:41,603 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:41,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:41,603 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-04 11:58:41,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:41,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:41,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:41,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:42,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:42,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:42,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:42,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:42,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:42,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:42,668 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-04 11:58:42,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:42,678 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:42,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-04 11:58:42,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:42,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:42,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:45,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:45,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-04 11:58:45,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:45,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:58:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:58:45,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:58:45,953 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-04 11:58:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:46,116 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-04 11:58:46,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-04 11:58:46,117 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-04 11:58:46,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:46,118 INFO L225 Difference]: With dead ends: 57 [2018-12-04 11:58:46,118 INFO L226 Difference]: Without dead ends: 55 [2018-12-04 11:58:46,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:58:46,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-04 11:58:46,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-04 11:58:46,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-04 11:58:46,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-04 11:58:46,122 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-04 11:58:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:46,122 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-04 11:58:46,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:58:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-04 11:58:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-04 11:58:46,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:46,123 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-04 11:58:46,123 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:46,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:46,123 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-04 11:58:46,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:46,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:46,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:46,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:46,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:47,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:47,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:47,196 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:47,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:47,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:47,196 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-04 11:58:47,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:47,205 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:47,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:47,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:47,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:47,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:50,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:50,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-04 11:58:50,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:50,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-04 11:58:50,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-04 11:58:50,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:58:50,386 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-04 11:58:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:50,485 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-04 11:58:50,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 11:58:50,486 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-04 11:58:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:50,486 INFO L225 Difference]: With dead ends: 58 [2018-12-04 11:58:50,486 INFO L226 Difference]: Without dead ends: 56 [2018-12-04 11:58:50,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:58:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-04 11:58:50,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-04 11:58:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-04 11:58:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-04 11:58:50,489 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-04 11:58:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:50,489 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-04 11:58:50,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-04 11:58:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-04 11:58:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-04 11:58:50,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:50,490 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-04 11:58:50,490 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:50,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-04 11:58:50,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:50,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:50,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:50,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:51,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:51,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:51,808 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:51,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:51,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:51,808 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-04 11:58:51,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:51,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:51,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:51,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:55,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:55,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-04 11:58:55,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:55,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:58:55,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:58:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:58:55,050 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-04 11:58:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:55,156 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-04 11:58:55,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 11:58:55,156 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-04 11:58:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:55,157 INFO L225 Difference]: With dead ends: 59 [2018-12-04 11:58:55,158 INFO L226 Difference]: Without dead ends: 57 [2018-12-04 11:58:55,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:58:55,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-04 11:58:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-04 11:58:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-04 11:58:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-04 11:58:55,161 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-04 11:58:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:55,161 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-04 11:58:55,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:58:55,161 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-04 11:58:55,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-04 11:58:55,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:55,162 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-04 11:58:55,162 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:55,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-04 11:58:55,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:55,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:55,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:56,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:56,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:56,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:56,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:56,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:56,337 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-04 11:58:56,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:56,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:56,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-04 11:58:56,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:56,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:56,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:59,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:58:59,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:59,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-04 11:58:59,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:59,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-04 11:58:59,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-04 11:58:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:58:59,925 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-04 11:58:59,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:59,997 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-04 11:58:59,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-04 11:58:59,997 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-04 11:58:59,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:59,998 INFO L225 Difference]: With dead ends: 60 [2018-12-04 11:58:59,998 INFO L226 Difference]: Without dead ends: 58 [2018-12-04 11:58:59,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:58:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-04 11:59:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-04 11:59:00,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-04 11:59:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-04 11:59:00,001 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-04 11:59:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:00,002 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-04 11:59:00,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-04 11:59:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-04 11:59:00,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-04 11:59:00,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:00,002 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-04 11:59:00,002 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:00,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-04 11:59:00,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:00,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:00,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:00,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:01,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:01,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:01,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:01,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:01,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:01,217 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-04 11:59:01,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:01,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:01,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:01,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:01,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:01,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:01,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:04,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:04,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-04 11:59:04,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:04,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-04 11:59:04,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-04 11:59:04,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:59:04,588 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-04 11:59:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:04,720 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-04 11:59:04,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-04 11:59:04,720 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-04 11:59:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:04,721 INFO L225 Difference]: With dead ends: 61 [2018-12-04 11:59:04,721 INFO L226 Difference]: Without dead ends: 59 [2018-12-04 11:59:04,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:59:04,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-04 11:59:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-04 11:59:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 11:59:04,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-04 11:59:04,724 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-04 11:59:04,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:04,724 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-04 11:59:04,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-04 11:59:04,725 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-04 11:59:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 11:59:04,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:04,725 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-04 11:59:04,725 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:04,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:04,726 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-04 11:59:04,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:04,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:04,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:04,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:04,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:06,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:06,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:06,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:06,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:06,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:06,401 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-04 11:59:06,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:06,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:06,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:06,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:10,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:10,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-04 11:59:10,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:10,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-04 11:59:10,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-04 11:59:10,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:59:10,063 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-04 11:59:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:10,181 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-04 11:59:10,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-04 11:59:10,182 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-04 11:59:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:10,183 INFO L225 Difference]: With dead ends: 62 [2018-12-04 11:59:10,183 INFO L226 Difference]: Without dead ends: 60 [2018-12-04 11:59:10,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:59:10,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-04 11:59:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-04 11:59:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-04 11:59:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-04 11:59:10,186 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-04 11:59:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:10,187 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-04 11:59:10,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-04 11:59:10,187 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-04 11:59:10,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-04 11:59:10,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:10,187 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-04 11:59:10,187 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:10,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:10,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-04 11:59:10,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:10,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:10,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:10,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:11,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:11,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:11,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:11,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:11,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:11,480 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-04 11:59:11,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:11,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:11,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-04 11:59:11,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:11,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:11,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:15,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:15,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:15,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-04 11:59:15,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:15,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 11:59:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 11:59:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-04 11:59:15,472 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-04 11:59:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:15,551 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-04 11:59:15,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-04 11:59:15,551 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-04 11:59:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:15,552 INFO L225 Difference]: With dead ends: 63 [2018-12-04 11:59:15,552 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:59:15,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-04 11:59:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:59:15,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-04 11:59:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-04 11:59:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-04 11:59:15,556 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-04 11:59:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:15,557 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-04 11:59:15,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 11:59:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-04 11:59:15,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-04 11:59:15,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:15,557 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-04 11:59:15,558 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:15,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:15,558 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-04 11:59:15,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:15,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:15,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:15,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:15,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:17,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:17,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:17,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:17,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:17,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:17,004 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-04 11:59:17,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:17,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:17,052 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:17,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:17,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:17,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:17,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:20,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:20,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-04 11:59:20,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:20,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-04 11:59:20,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-04 11:59:20,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:59:20,818 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-04 11:59:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:20,920 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-04 11:59:20,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-04 11:59:20,920 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-04 11:59:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:20,921 INFO L225 Difference]: With dead ends: 64 [2018-12-04 11:59:20,921 INFO L226 Difference]: Without dead ends: 62 [2018-12-04 11:59:20,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:59:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-04 11:59:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-04 11:59:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-04 11:59:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-04 11:59:20,924 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-04 11:59:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:20,924 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-04 11:59:20,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-04 11:59:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-04 11:59:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-04 11:59:20,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:20,925 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-04 11:59:20,925 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:20,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-04 11:59:20,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:20,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:20,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:20,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:22,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:22,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:22,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:22,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:22,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:22,358 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-04 11:59:22,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:22,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:22,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:22,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:26,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:26,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-04 11:59:26,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:26,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-04 11:59:26,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-04 11:59:26,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 11:59:26,567 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-04 11:59:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:26,661 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-04 11:59:26,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-04 11:59:26,661 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-04 11:59:26,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:26,662 INFO L225 Difference]: With dead ends: 65 [2018-12-04 11:59:26,662 INFO L226 Difference]: Without dead ends: 63 [2018-12-04 11:59:26,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 11:59:26,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-04 11:59:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-04 11:59:26,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 11:59:26,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-04 11:59:26,665 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-04 11:59:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:26,666 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-04 11:59:26,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-04 11:59:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-04 11:59:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 11:59:26,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:26,666 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-04 11:59:26,666 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:26,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:26,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-04 11:59:26,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:26,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:26,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:26,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:26,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:28,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:28,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:28,292 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:28,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:28,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:28,292 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-04 11:59:28,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:28,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:28,629 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-04 11:59:28,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:28,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:28,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:32,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:32,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-04 11:59:32,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:32,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-04 11:59:32,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-04 11:59:32,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:59:32,800 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-04 11:59:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:32,877 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-04 11:59:32,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-04 11:59:32,877 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-04 11:59:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:32,878 INFO L225 Difference]: With dead ends: 66 [2018-12-04 11:59:32,878 INFO L226 Difference]: Without dead ends: 64 [2018-12-04 11:59:32,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:59:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-04 11:59:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-04 11:59:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-04 11:59:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-04 11:59:32,881 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-04 11:59:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:32,882 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-04 11:59:32,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-04 11:59:32,882 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-04 11:59:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-04 11:59:32,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:32,882 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-04 11:59:32,882 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:32,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:32,883 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-04 11:59:32,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:32,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:32,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:32,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:34,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:34,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:34,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:34,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:34,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:34,517 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-04 11:59:34,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:34,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:34,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:34,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:34,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:34,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:34,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:38,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:38,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-04 11:59:38,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:38,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-04 11:59:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-04 11:59:38,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 11:59:38,806 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-04 11:59:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:38,922 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-04 11:59:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-04 11:59:38,923 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-04 11:59:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:38,923 INFO L225 Difference]: With dead ends: 67 [2018-12-04 11:59:38,924 INFO L226 Difference]: Without dead ends: 65 [2018-12-04 11:59:38,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 11:59:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-04 11:59:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-04 11:59:38,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-04 11:59:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-04 11:59:38,926 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-04 11:59:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:38,927 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-04 11:59:38,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-04 11:59:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-04 11:59:38,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-04 11:59:38,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:38,928 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-04 11:59:38,928 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:38,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-04 11:59:38,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:38,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:38,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:38,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:38,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:40,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:40,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:40,535 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:40,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:40,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:40,535 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-04 11:59:40,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:40,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:40,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:40,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-04 11:59:44,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:44,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-04 11:59:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-04 11:59:44,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:59:44,678 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-04 11:59:44,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:44,813 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-04 11:59:44,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-04 11:59:44,814 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-04 11:59:44,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:44,814 INFO L225 Difference]: With dead ends: 68 [2018-12-04 11:59:44,814 INFO L226 Difference]: Without dead ends: 66 [2018-12-04 11:59:44,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:59:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-04 11:59:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-04 11:59:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-04 11:59:44,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-04 11:59:44,817 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-04 11:59:44,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:44,817 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-04 11:59:44,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-04 11:59:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-04 11:59:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-04 11:59:44,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:44,817 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-04 11:59:44,818 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:44,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-04 11:59:44,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:44,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:44,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:44,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:47,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:47,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:47,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:47,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:47,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:47,023 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-04 11:59:47,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:47,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:47,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-04 11:59:47,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:47,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:47,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:51,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-04 11:59:51,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:51,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 11:59:51,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 11:59:51,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-04 11:59:51,831 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-04 11:59:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:51,950 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-04 11:59:51,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-04 11:59:51,950 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-04 11:59:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:51,951 INFO L225 Difference]: With dead ends: 69 [2018-12-04 11:59:51,951 INFO L226 Difference]: Without dead ends: 67 [2018-12-04 11:59:51,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-04 11:59:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-04 11:59:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-04 11:59:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-04 11:59:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-04 11:59:51,955 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-04 11:59:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:51,955 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-04 11:59:51,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 11:59:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-04 11:59:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-04 11:59:51,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:51,956 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-04 11:59:51,956 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:51,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:51,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-04 11:59:51,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:51,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:51,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:51,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:51,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:53,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:53,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:53,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:53,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:53,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:53,512 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-04 11:59:53,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:53,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:53,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:53,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:53,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:53,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:59:58,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:58,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-04 11:59:58,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:58,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-04 11:59:58,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-04 11:59:58,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 11:59:58,383 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-04 11:59:58,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:58,508 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-04 11:59:58,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-04 11:59:58,516 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-04 11:59:58,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:58,517 INFO L225 Difference]: With dead ends: 70 [2018-12-04 11:59:58,517 INFO L226 Difference]: Without dead ends: 68 [2018-12-04 11:59:58,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 11:59:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-04 11:59:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-04 11:59:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-04 11:59:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-04 11:59:58,521 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-04 11:59:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:58,521 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-04 11:59:58,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-04 11:59:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-04 11:59:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-04 11:59:58,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:58,522 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-04 11:59:58,522 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:58,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-04 11:59:58,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:58,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:58,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:58,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:58,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:00,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:00,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:00,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:00,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:00,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:00,115 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-04 12:00:00,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:00,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:00,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:00,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:04,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:04,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:04,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-04 12:00:04,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:04,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-04 12:00:04,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-04 12:00:04,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-04 12:00:04,801 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-04 12:00:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:04,896 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-04 12:00:04,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-04 12:00:04,897 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-04 12:00:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:04,897 INFO L225 Difference]: With dead ends: 71 [2018-12-04 12:00:04,898 INFO L226 Difference]: Without dead ends: 69 [2018-12-04 12:00:04,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-04 12:00:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-04 12:00:04,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-04 12:00:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-04 12:00:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-04 12:00:04,901 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-04 12:00:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:04,902 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-04 12:00:04,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-04 12:00:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-04 12:00:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-04 12:00:04,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:04,902 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-04 12:00:04,902 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:04,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:04,903 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-04 12:00:04,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:04,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:04,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:04,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:04,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:07,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:07,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:07,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:07,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:07,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:07,518 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-04 12:00:07,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:07,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:07,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-04 12:00:07,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:07,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:07,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:13,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:13,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-04 12:00:13,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:13,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-04 12:00:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-04 12:00:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 12:00:13,223 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-04 12:00:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:13,325 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-04 12:00:13,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-04 12:00:13,326 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-04 12:00:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:13,326 INFO L225 Difference]: With dead ends: 72 [2018-12-04 12:00:13,326 INFO L226 Difference]: Without dead ends: 70 [2018-12-04 12:00:13,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 12:00:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-04 12:00:13,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-04 12:00:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-04 12:00:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-04 12:00:13,329 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-04 12:00:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:13,330 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-04 12:00:13,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-04 12:00:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-04 12:00:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-04 12:00:13,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:13,330 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-04 12:00:13,331 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:13,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-04 12:00:13,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:13,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:13,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:14,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:14,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:14,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:14,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:14,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:14,992 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-04 12:00:15,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:15,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:15,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:15,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:15,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:15,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:20,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:20,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-04 12:00:20,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:20,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-04 12:00:20,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-04 12:00:20,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 12:00:20,092 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-04 12:00:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:20,437 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-04 12:00:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-04 12:00:20,438 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-04 12:00:20,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:20,438 INFO L225 Difference]: With dead ends: 73 [2018-12-04 12:00:20,438 INFO L226 Difference]: Without dead ends: 71 [2018-12-04 12:00:20,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 12:00:20,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-04 12:00:20,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-04 12:00:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-04 12:00:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-04 12:00:20,441 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-04 12:00:20,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:20,442 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-04 12:00:20,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-04 12:00:20,442 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-04 12:00:20,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-04 12:00:20,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:20,443 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-04 12:00:20,443 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:20,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:20,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-04 12:00:20,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:20,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:20,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:20,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:20,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:22,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:22,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:22,547 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:22,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:22,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:22,547 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:22,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:22,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:22,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:22,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:27,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:27,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-04 12:00:27,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:27,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-04 12:00:27,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-04 12:00:27,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-04 12:00:27,742 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-04 12:00:27,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:27,838 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-04 12:00:27,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-04 12:00:27,839 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-04 12:00:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:27,840 INFO L225 Difference]: With dead ends: 74 [2018-12-04 12:00:27,840 INFO L226 Difference]: Without dead ends: 72 [2018-12-04 12:00:27,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-04 12:00:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-04 12:00:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-04 12:00:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-04 12:00:27,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-04 12:00:27,844 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-04 12:00:27,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:27,844 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-04 12:00:27,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-04 12:00:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-04 12:00:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-04 12:00:27,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:27,844 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-04 12:00:27,845 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:27,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-04 12:00:27,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:27,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:27,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:27,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:27,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:29,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:29,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:29,580 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:29,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:29,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:29,580 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:29,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:29,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:30,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-04 12:00:30,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:30,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:30,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:35,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:35,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:35,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-04 12:00:35,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:35,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 12:00:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 12:00:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 12:00:35,356 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-04 12:00:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:35,563 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-04 12:00:35,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-04 12:00:35,563 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-04 12:00:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:35,564 INFO L225 Difference]: With dead ends: 75 [2018-12-04 12:00:35,564 INFO L226 Difference]: Without dead ends: 73 [2018-12-04 12:00:35,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 12:00:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-04 12:00:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-04 12:00:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 12:00:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-04 12:00:35,566 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-04 12:00:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:35,566 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-04 12:00:35,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 12:00:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-04 12:00:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 12:00:35,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:35,567 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-04 12:00:35,567 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:35,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-04 12:00:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:35,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:35,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:37,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:37,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:37,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:37,701 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:37,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:37,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:37,701 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:37,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:37,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:37,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:37,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:37,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:37,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:43,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:43,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-04 12:00:43,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:43,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-04 12:00:43,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-04 12:00:43,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 12:00:43,176 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-04 12:00:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:43,370 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-04 12:00:43,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-04 12:00:43,371 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-04 12:00:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:43,372 INFO L225 Difference]: With dead ends: 76 [2018-12-04 12:00:43,372 INFO L226 Difference]: Without dead ends: 74 [2018-12-04 12:00:43,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 12:00:43,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-04 12:00:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-04 12:00:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-04 12:00:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-04 12:00:43,376 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-04 12:00:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:43,376 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-04 12:00:43,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-04 12:00:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-04 12:00:43,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-04 12:00:43,377 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:43,377 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-04 12:00:43,377 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:43,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:43,378 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-04 12:00:43,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:43,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:43,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:43,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:45,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:45,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:45,202 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:45,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:45,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:45,202 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:45,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:45,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:45,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:45,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:50,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:50,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:50,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-04 12:00:50,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:50,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-04 12:00:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-04 12:00:50,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-04 12:00:50,947 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-04 12:00:51,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:51,087 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-04 12:00:51,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-04 12:00:51,087 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-04 12:00:51,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:51,088 INFO L225 Difference]: With dead ends: 77 [2018-12-04 12:00:51,088 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 12:00:51,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-04 12:00:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 12:00:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-04 12:00:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-04 12:00:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-04 12:00:51,093 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-04 12:00:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:51,094 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-04 12:00:51,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-04 12:00:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-04 12:00:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-04 12:00:51,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:51,094 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-04 12:00:51,095 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:51,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:51,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-04 12:00:51,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:51,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:51,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:51,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:51,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:53,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:53,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:53,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:53,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:53,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:53,245 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:00:53,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:53,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:53,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-04 12:00:53,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:53,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:53,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:59,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:59,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-04 12:00:59,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:59,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-04 12:00:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-04 12:00:59,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-04 12:00:59,655 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-04 12:00:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:59,805 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-04 12:00:59,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-04 12:00:59,805 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-04 12:00:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:59,806 INFO L225 Difference]: With dead ends: 78 [2018-12-04 12:00:59,806 INFO L226 Difference]: Without dead ends: 76 [2018-12-04 12:00:59,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-04 12:00:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-04 12:00:59,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-04 12:00:59,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-04 12:00:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-04 12:00:59,810 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-04 12:00:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:59,810 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-04 12:00:59,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-04 12:00:59,811 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-04 12:00:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-04 12:00:59,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:59,811 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-04 12:00:59,811 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:59,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-04 12:00:59,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:59,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:59,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:01,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:01,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:01,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:01,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:01,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:01,816 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:01,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:01,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:01,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:01,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:01,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:01,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:08,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:08,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-04 12:01:08,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:08,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-04 12:01:08,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-04 12:01:08,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 12:01:08,108 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-04 12:01:08,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:08,256 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-04 12:01:08,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-04 12:01:08,256 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-04 12:01:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:08,257 INFO L225 Difference]: With dead ends: 79 [2018-12-04 12:01:08,257 INFO L226 Difference]: Without dead ends: 77 [2018-12-04 12:01:08,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 12:01:08,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-04 12:01:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-04 12:01:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-04 12:01:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-04 12:01:08,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-04 12:01:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:08,261 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-04 12:01:08,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-04 12:01:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-04 12:01:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-04 12:01:08,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:08,261 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-04 12:01:08,262 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:08,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-04 12:01:08,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:08,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:08,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:08,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:10,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:10,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:10,519 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:10,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:10,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:10,519 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:10,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:10,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:10,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:10,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:16,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:16,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:16,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-04 12:01:16,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:16,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-04 12:01:16,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-04 12:01:16,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 12:01:16,801 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-04 12:01:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:16,964 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-04 12:01:16,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-04 12:01:16,965 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-04 12:01:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:16,965 INFO L225 Difference]: With dead ends: 80 [2018-12-04 12:01:16,965 INFO L226 Difference]: Without dead ends: 78 [2018-12-04 12:01:16,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 12:01:16,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-04 12:01:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-04 12:01:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-04 12:01:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-04 12:01:16,968 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-04 12:01:16,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:16,969 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-04 12:01:16,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-04 12:01:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-04 12:01:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-04 12:01:16,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:16,969 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-04 12:01:16,969 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:16,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:16,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-04 12:01:16,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:16,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:16,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:16,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:16,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:19,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:19,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:19,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:19,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:19,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:19,274 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:19,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:19,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:19,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-04 12:01:19,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:19,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:19,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:26,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:26,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-04 12:01:26,180 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:26,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 12:01:26,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 12:01:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-04 12:01:26,181 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-04 12:01:26,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:26,292 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-04 12:01:26,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-04 12:01:26,292 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-04 12:01:26,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:26,293 INFO L225 Difference]: With dead ends: 81 [2018-12-04 12:01:26,293 INFO L226 Difference]: Without dead ends: 79 [2018-12-04 12:01:26,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-04 12:01:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-04 12:01:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-04 12:01:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-04 12:01:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-04 12:01:26,297 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-04 12:01:26,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:26,297 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-04 12:01:26,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 12:01:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-04 12:01:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-04 12:01:26,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:26,298 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-04 12:01:26,299 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:26,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:26,299 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-04 12:01:26,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:26,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:26,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:26,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:28,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:28,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:28,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:28,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:28,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:28,624 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:28,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:28,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:28,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:28,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:28,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:28,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:35,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:35,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-04 12:01:35,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:35,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-04 12:01:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-04 12:01:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 12:01:35,269 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-04 12:01:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:35,383 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-04 12:01:35,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-04 12:01:35,383 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-04 12:01:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:35,384 INFO L225 Difference]: With dead ends: 82 [2018-12-04 12:01:35,384 INFO L226 Difference]: Without dead ends: 80 [2018-12-04 12:01:35,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 12:01:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-04 12:01:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-04 12:01:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-04 12:01:35,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-04 12:01:35,388 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-04 12:01:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:35,388 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-04 12:01:35,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-04 12:01:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-04 12:01:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-04 12:01:35,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:35,389 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-04 12:01:35,389 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:35,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-04 12:01:35,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:35,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:35,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:37,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:37,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:37,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:37,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:37,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:37,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:37,544 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:37,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:37,553 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:37,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:37,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:44,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:44,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-04 12:01:44,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:44,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-04 12:01:44,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-04 12:01:44,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-04 12:01:44,331 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-04 12:01:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:44,717 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-04 12:01:44,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-04 12:01:44,717 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-04 12:01:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:44,718 INFO L225 Difference]: With dead ends: 83 [2018-12-04 12:01:44,718 INFO L226 Difference]: Without dead ends: 81 [2018-12-04 12:01:44,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-04 12:01:44,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-04 12:01:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-04 12:01:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-04 12:01:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-04 12:01:44,720 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-04 12:01:44,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:44,721 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-04 12:01:44,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-04 12:01:44,721 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-04 12:01:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-04 12:01:44,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:44,721 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-04 12:01:44,721 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:44,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:44,722 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-04 12:01:44,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:44,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:44,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:46,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:46,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:46,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:46,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:46,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:46,890 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:46,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:47,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-04 12:01:47,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:47,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:47,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:54,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:54,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-04 12:01:54,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:54,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-04 12:01:54,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-04 12:01:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 12:01:54,943 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-04 12:01:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:55,600 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-04 12:01:55,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-04 12:01:55,601 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-04 12:01:55,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:55,601 INFO L225 Difference]: With dead ends: 84 [2018-12-04 12:01:55,601 INFO L226 Difference]: Without dead ends: 82 [2018-12-04 12:01:55,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 12:01:55,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-04 12:01:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-04 12:01:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-04 12:01:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-04 12:01:55,605 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-04 12:01:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:55,606 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-04 12:01:55,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-04 12:01:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-04 12:01:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-04 12:01:55,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:55,606 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-04 12:01:55,607 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:55,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:55,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-04 12:01:55,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:55,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:55,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:55,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:58,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:58,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:58,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:58,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:58,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:58,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:58,217 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:01:58,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:58,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:58,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:58,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:58,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:58,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:58,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:05,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:05,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-04 12:02:05,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:05,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-04 12:02:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-04 12:02:05,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 12:02:05,549 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-04 12:02:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:05,699 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-04 12:02:05,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-04 12:02:05,700 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-04 12:02:05,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:05,700 INFO L225 Difference]: With dead ends: 85 [2018-12-04 12:02:05,700 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 12:02:05,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 12:02:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 12:02:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-04 12:02:05,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-04 12:02:05,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-04 12:02:05,704 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-04 12:02:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:05,705 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-04 12:02:05,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-04 12:02:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-04 12:02:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-04 12:02:05,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:05,706 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-04 12:02:05,706 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:05,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:05,706 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-04 12:02:05,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:05,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:05,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:08,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:08,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:08,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:08,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:08,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:08,019 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:02:08,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:08,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:02:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:08,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:08,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:15,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:15,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-04 12:02:15,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:15,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-04 12:02:15,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-04 12:02:15,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-04 12:02:15,333 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-04 12:02:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:15,457 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-04 12:02:15,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-04 12:02:15,458 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-04 12:02:15,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:15,459 INFO L225 Difference]: With dead ends: 86 [2018-12-04 12:02:15,459 INFO L226 Difference]: Without dead ends: 84 [2018-12-04 12:02:15,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-04 12:02:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-04 12:02:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-04 12:02:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-04 12:02:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-04 12:02:15,462 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-04 12:02:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:15,463 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-04 12:02:15,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-04 12:02:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-04 12:02:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-04 12:02:15,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:15,463 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-04 12:02:15,463 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:15,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:15,464 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-04 12:02:15,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:15,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:15,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:15,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:15,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:17,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:17,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:17,995 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:17,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:17,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:17,995 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:02:18,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:02:18,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:02:18,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-04 12:02:18,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:18,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:18,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:26,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:26,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-04 12:02:26,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:26,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-04 12:02:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-04 12:02:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 12:02:26,290 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-04 12:02:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:26,488 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-04 12:02:26,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-04 12:02:26,488 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-04 12:02:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:26,489 INFO L225 Difference]: With dead ends: 87 [2018-12-04 12:02:26,489 INFO L226 Difference]: Without dead ends: 85 [2018-12-04 12:02:26,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 12:02:26,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-04 12:02:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-04 12:02:26,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-04 12:02:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-04 12:02:26,492 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-04 12:02:26,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:26,492 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-04 12:02:26,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-04 12:02:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-04 12:02:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-04 12:02:26,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:26,493 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-04 12:02:26,493 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:26,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:26,493 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-04 12:02:26,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:26,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:26,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:26,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:26,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:28,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:28,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:28,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:28,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:28,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:28,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:28,972 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:02:28,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:02:28,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:02:29,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:02:29,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:29,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:29,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:29,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:36,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:36,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:36,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-04 12:02:36,598 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:36,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-04 12:02:36,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-04 12:02:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 12:02:36,600 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-04 12:02:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:36,779 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-04 12:02:36,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-04 12:02:36,779 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-04 12:02:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:36,780 INFO L225 Difference]: With dead ends: 88 [2018-12-04 12:02:36,780 INFO L226 Difference]: Without dead ends: 86 [2018-12-04 12:02:36,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 12:02:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-04 12:02:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-04 12:02:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-04 12:02:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-04 12:02:36,782 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-04 12:02:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:36,783 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-04 12:02:36,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-04 12:02:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-04 12:02:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-04 12:02:36,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:36,783 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-04 12:02:36,783 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:36,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-04 12:02:36,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:36,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:36,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:39,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:39,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:39,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:39,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:39,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:39,275 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:02:39,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:39,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:02:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:39,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:39,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:47,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:47,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:47,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-04 12:02:47,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:47,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-04 12:02:47,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-04 12:02:47,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-04 12:02:47,060 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-04 12:02:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:47,301 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-04 12:02:47,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-04 12:02:47,301 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-04 12:02:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:47,302 INFO L225 Difference]: With dead ends: 89 [2018-12-04 12:02:47,302 INFO L226 Difference]: Without dead ends: 87 [2018-12-04 12:02:47,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-04 12:02:47,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-04 12:02:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-04 12:02:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 12:02:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-04 12:02:47,305 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-04 12:02:47,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:47,306 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-04 12:02:47,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-04 12:02:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-04 12:02:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 12:02:47,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:47,306 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-04 12:02:47,307 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:47,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:47,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-04 12:02:47,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:47,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:47,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:47,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:47,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:50,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:50,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:50,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:50,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:50,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:50,128 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:02:50,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:02:50,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:02:51,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-04 12:02:51,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:51,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:51,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:59,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:59,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-04 12:02:59,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:59,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-04 12:02:59,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-04 12:02:59,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-04 12:02:59,003 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-04 12:02:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:59,153 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-04 12:02:59,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-04 12:02:59,154 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-04 12:02:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:59,154 INFO L225 Difference]: With dead ends: 90 [2018-12-04 12:02:59,154 INFO L226 Difference]: Without dead ends: 88 [2018-12-04 12:02:59,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-04 12:02:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-04 12:02:59,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-04 12:02:59,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-04 12:02:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-04 12:02:59,157 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-04 12:02:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:59,157 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-04 12:02:59,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-04 12:02:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-04 12:02:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-04 12:02:59,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:59,158 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-04 12:02:59,158 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:59,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-04 12:02:59,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:59,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:59,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:02,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:02,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:02,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:02,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:02,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:02,007 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:03:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:03:02,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:03:02,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:03:02,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:02,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:02,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:09,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:09,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-04 12:03:09,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:09,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-04 12:03:09,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-04 12:03:09,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 12:03:09,859 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-04 12:03:10,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:10,022 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-04 12:03:10,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-04 12:03:10,022 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-04 12:03:10,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:10,023 INFO L225 Difference]: With dead ends: 91 [2018-12-04 12:03:10,023 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 12:03:10,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 12:03:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 12:03:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-04 12:03:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-04 12:03:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-04 12:03:10,026 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-04 12:03:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:10,026 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-04 12:03:10,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-04 12:03:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-04 12:03:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-04 12:03:10,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:10,027 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-04 12:03:10,028 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:10,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-04 12:03:10,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:10,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:10,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:10,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:12,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:12,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:12,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:12,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:12,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:12,941 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:03:12,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:12,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:03:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:13,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:13,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:13,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:21,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:21,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-04 12:03:21,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:21,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-04 12:03:21,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-04 12:03:21,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 12:03:21,262 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-04 12:03:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:21,643 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-04 12:03:21,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-04 12:03:21,643 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-04 12:03:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:21,644 INFO L225 Difference]: With dead ends: 92 [2018-12-04 12:03:21,644 INFO L226 Difference]: Without dead ends: 90 [2018-12-04 12:03:21,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 12:03:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-04 12:03:21,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-04 12:03:21,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-04 12:03:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-04 12:03:21,647 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-04 12:03:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:21,647 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-04 12:03:21,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-04 12:03:21,648 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-04 12:03:21,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-04 12:03:21,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:21,648 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-04 12:03:21,648 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:21,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:21,649 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-04 12:03:21,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:21,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:21,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:21,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:21,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:24,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:24,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:24,398 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:24,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:24,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:24,399 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:03:24,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:03:24,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:03:25,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-04 12:03:25,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:25,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:25,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:34,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:34,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-04 12:03:34,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:34,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 12:03:34,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 12:03:34,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-04 12:03:34,079 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-04 12:03:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:34,310 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-04 12:03:34,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-04 12:03:34,310 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-04 12:03:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:34,311 INFO L225 Difference]: With dead ends: 93 [2018-12-04 12:03:34,311 INFO L226 Difference]: Without dead ends: 91 [2018-12-04 12:03:34,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-04 12:03:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-04 12:03:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-04 12:03:34,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-04 12:03:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-04 12:03:34,314 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-04 12:03:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:34,314 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-04 12:03:34,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 12:03:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-04 12:03:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-04 12:03:34,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:34,315 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-04 12:03:34,315 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:34,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:34,316 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-04 12:03:34,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:34,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:34,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:34,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:37,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:37,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:37,555 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:37,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:37,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:37,555 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:03:37,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:03:37,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:03:37,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:03:37,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:37,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:37,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:46,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:46,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-04 12:03:46,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:46,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-04 12:03:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-04 12:03:46,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 12:03:46,188 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-04 12:03:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:46,343 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-04 12:03:46,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-04 12:03:46,344 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-04 12:03:46,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:46,345 INFO L225 Difference]: With dead ends: 94 [2018-12-04 12:03:46,345 INFO L226 Difference]: Without dead ends: 92 [2018-12-04 12:03:46,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 12:03:46,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-04 12:03:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-04 12:03:46,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-04 12:03:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-04 12:03:46,348 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-04 12:03:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:46,348 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-04 12:03:46,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-04 12:03:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-04 12:03:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-04 12:03:46,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:46,349 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-04 12:03:46,349 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:46,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:46,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-04 12:03:46,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:46,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:46,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:46,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:46,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:49,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:49,174 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:49,174 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:49,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:49,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:49,175 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:03:49,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:49,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:03:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:49,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:49,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:58,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:58,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:58,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-04 12:03:58,020 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:58,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-04 12:03:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-04 12:03:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-04 12:03:58,022 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-04 12:03:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:58,255 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-04 12:03:58,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-04 12:03:58,256 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-04 12:03:58,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:58,256 INFO L225 Difference]: With dead ends: 95 [2018-12-04 12:03:58,256 INFO L226 Difference]: Without dead ends: 93 [2018-12-04 12:03:58,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-04 12:03:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-04 12:03:58,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-04 12:03:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-04 12:03:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-04 12:03:58,259 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-04 12:03:58,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:58,259 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-04 12:03:58,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-04 12:03:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-04 12:03:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-04 12:03:58,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:58,260 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-04 12:03:58,260 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:58,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-04 12:03:58,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:58,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:58,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:58,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:01,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:01,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:01,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:01,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:01,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:01,136 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:04:01,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:04:01,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:04:02,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-04 12:04:02,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:02,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:02,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:11,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:11,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:11,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-04 12:04:11,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:11,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-04 12:04:11,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-04 12:04:11,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 12:04:11,268 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-04 12:04:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:11,413 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-04 12:04:11,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-04 12:04:11,414 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-04 12:04:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:11,415 INFO L225 Difference]: With dead ends: 96 [2018-12-04 12:04:11,415 INFO L226 Difference]: Without dead ends: 94 [2018-12-04 12:04:11,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 12:04:11,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-04 12:04:11,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-04 12:04:11,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-04 12:04:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-04 12:04:11,418 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-04 12:04:11,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:11,418 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-04 12:04:11,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-04 12:04:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-04 12:04:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-04 12:04:11,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:11,419 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-04 12:04:11,419 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:11,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:11,419 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-04 12:04:11,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:11,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:11,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:11,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:14,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:14,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:14,684 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:14,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:14,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:14,684 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:04:14,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:04:14,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:04:14,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:04:14,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:14,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:14,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:24,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:24,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:24,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-04 12:04:24,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:24,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-04 12:04:24,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-04 12:04:24,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 12:04:24,168 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-04 12:04:24,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:24,433 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-04 12:04:24,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-04 12:04:24,433 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-04 12:04:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:24,434 INFO L225 Difference]: With dead ends: 97 [2018-12-04 12:04:24,434 INFO L226 Difference]: Without dead ends: 95 [2018-12-04 12:04:24,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 12:04:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-04 12:04:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-04 12:04:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-04 12:04:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-04 12:04:24,438 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-04 12:04:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:24,438 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-04 12:04:24,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-04 12:04:24,438 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-04 12:04:24,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-04 12:04:24,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:24,439 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-04 12:04:24,439 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:24,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:24,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-04 12:04:24,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:24,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:24,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:27,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:27,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:27,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:27,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:27,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:27,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:27,787 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:04:27,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:04:27,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:04:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:27,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:27,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:36,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:36,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-04 12:04:36,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:36,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-04 12:04:36,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-04 12:04:36,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-04 12:04:36,944 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-04 12:04:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:37,205 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-04 12:04:37,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-04 12:04:37,205 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-04 12:04:37,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:37,206 INFO L225 Difference]: With dead ends: 98 [2018-12-04 12:04:37,206 INFO L226 Difference]: Without dead ends: 96 [2018-12-04 12:04:37,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-04 12:04:37,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-04 12:04:37,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-04 12:04:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-04 12:04:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-04 12:04:37,209 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-04 12:04:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:37,209 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-04 12:04:37,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-04 12:04:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-04 12:04:37,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-04 12:04:37,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:37,210 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-04 12:04:37,210 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:37,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-04 12:04:37,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:37,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:04:37,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:37,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:40,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:40,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:40,494 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:40,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:40,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:40,494 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:04:40,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:04:40,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:04:42,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-04 12:04:42,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:42,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:42,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:51,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:51,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:51,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-04 12:04:51,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:51,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 12:04:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 12:04:51,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-04 12:04:51,732 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-04 12:04:51,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:51,918 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-04 12:04:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-04 12:04:51,919 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-04 12:04:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:51,920 INFO L225 Difference]: With dead ends: 99 [2018-12-04 12:04:51,920 INFO L226 Difference]: Without dead ends: 97 [2018-12-04 12:04:51,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-04 12:04:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-04 12:04:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-04 12:04:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-04 12:04:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-04 12:04:51,923 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-04 12:04:51,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:51,923 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-04 12:04:51,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 12:04:51,923 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-04 12:04:51,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-04 12:04:51,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:51,923 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-04 12:04:51,924 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:51,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:51,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-04 12:04:51,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:51,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:51,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:55,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:55,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:55,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:55,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:55,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:55,348 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:04:55,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:04:55,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:04:55,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:04:55,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:55,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:55,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:05,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:05,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:05,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-04 12:05:05,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:05,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-04 12:05:05,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-04 12:05:05,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 12:05:05,367 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-04 12:05:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:05,521 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-04 12:05:05,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-04 12:05:05,521 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-04 12:05:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:05,522 INFO L225 Difference]: With dead ends: 100 [2018-12-04 12:05:05,522 INFO L226 Difference]: Without dead ends: 98 [2018-12-04 12:05:05,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 12:05:05,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-04 12:05:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-04 12:05:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-04 12:05:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-04 12:05:05,527 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-04 12:05:05,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:05,527 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-04 12:05:05,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-04 12:05:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-04 12:05:05,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-04 12:05:05,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:05,528 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-04 12:05:05,528 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:05,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:05,529 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-04 12:05:05,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:05,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:05,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:05,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:08,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:08,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:08,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:08,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:08,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:08,948 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:05:08,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:08,956 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:05:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:09,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:09,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:18,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:18,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-04 12:05:18,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:18,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-04 12:05:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-04 12:05:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-04 12:05:18,994 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-04 12:05:19,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:19,150 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-04 12:05:19,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-04 12:05:19,150 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-04 12:05:19,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:19,151 INFO L225 Difference]: With dead ends: 101 [2018-12-04 12:05:19,151 INFO L226 Difference]: Without dead ends: 99 [2018-12-04 12:05:19,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-04 12:05:19,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-04 12:05:19,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-04 12:05:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-04 12:05:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-04 12:05:19,156 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-04 12:05:19,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:19,156 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-04 12:05:19,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-04 12:05:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-04 12:05:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-04 12:05:19,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:19,157 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-04 12:05:19,158 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:19,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-04 12:05:19,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:19,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:19,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:19,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:22,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:22,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:22,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:22,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:22,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:22,444 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:05:22,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:05:22,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:05:24,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-04 12:05:24,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:24,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:24,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:24,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:34,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:34,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-04 12:05:34,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:34,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-04 12:05:34,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-04 12:05:34,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 12:05:34,582 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-04 12:05:34,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:34,752 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-04 12:05:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-04 12:05:34,752 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-04 12:05:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:34,753 INFO L225 Difference]: With dead ends: 102 [2018-12-04 12:05:34,753 INFO L226 Difference]: Without dead ends: 100 [2018-12-04 12:05:34,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 12:05:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-04 12:05:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-04 12:05:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-04 12:05:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-04 12:05:34,756 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-04 12:05:34,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:34,757 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-04 12:05:34,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-04 12:05:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-04 12:05:34,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-04 12:05:34,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:34,757 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-04 12:05:34,758 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:34,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:34,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-04 12:05:34,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:34,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:34,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:34,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:38,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:38,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:38,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:38,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:38,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:38,157 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:05:38,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:05:38,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:05:38,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:05:38,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:38,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:38,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:38,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:48,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:48,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-04 12:05:48,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:48,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-04 12:05:48,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-04 12:05:48,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 12:05:48,635 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-04 12:05:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:48,891 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-04 12:05:48,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-04 12:05:48,891 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-04 12:05:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:48,892 INFO L225 Difference]: With dead ends: 103 [2018-12-04 12:05:48,892 INFO L226 Difference]: Without dead ends: 101 [2018-12-04 12:05:48,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 12:05:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-04 12:05:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-04 12:05:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 12:05:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-04 12:05:48,896 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-04 12:05:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:48,896 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-04 12:05:48,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-04 12:05:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-04 12:05:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 12:05:48,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:48,896 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-04 12:05:48,897 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:48,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:48,897 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-04 12:05:48,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:48,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:48,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:48,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:48,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:52,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:52,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:52,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:52,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:52,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:52,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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:05:52,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:52,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:05:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:52,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:52,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:03,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:03,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-04 12:06:03,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:03,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-04 12:06:03,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-04 12:06:03,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 12:06:03,232 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-04 12:06:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:03,548 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-04 12:06:03,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-04 12:06:03,549 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-04 12:06:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:03,549 INFO L225 Difference]: With dead ends: 104 [2018-12-04 12:06:03,550 INFO L226 Difference]: Without dead ends: 102 [2018-12-04 12:06:03,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 12:06:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-04 12:06:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-04 12:06:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-04 12:06:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-04 12:06:03,554 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-04 12:06:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:03,554 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-04 12:06:03,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-04 12:06:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-04 12:06:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-04 12:06:03,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:03,555 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-04 12:06:03,555 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:03,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:03,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-04 12:06:03,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:03,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:03,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:03,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:03,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:07,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:07,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:07,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:07,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:07,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:07,296 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:06:07,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:06:07,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:06:09,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-04 12:06:09,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:09,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:09,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:09,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:20,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:20,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-04 12:06:20,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:20,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 12:06:20,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 12:06:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-04 12:06:20,282 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-04 12:06:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:20,539 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-04 12:06:20,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-04 12:06:20,540 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-04 12:06:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:20,540 INFO L225 Difference]: With dead ends: 105 [2018-12-04 12:06:20,540 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 12:06:20,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-04 12:06:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 12:06:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-04 12:06:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-04 12:06:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-04 12:06:20,544 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-04 12:06:20,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:20,544 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-04 12:06:20,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 12:06:20,544 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-04 12:06:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-04 12:06:20,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:20,545 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-04 12:06:20,545 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:20,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-04 12:06:20,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:20,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:06:20,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:20,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:24,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:24,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:24,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:24,125 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:24,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:24,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:24,125 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:06:24,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:06:24,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:06:24,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:06:24,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:24,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:24,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:24,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:35,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:35,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-04 12:06:35,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:35,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-04 12:06:35,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-04 12:06:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 12:06:35,423 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-04 12:06:35,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:35,713 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-04 12:06:35,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-04 12:06:35,713 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-04 12:06:35,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:35,714 INFO L225 Difference]: With dead ends: 106 [2018-12-04 12:06:35,714 INFO L226 Difference]: Without dead ends: 104 [2018-12-04 12:06:35,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 12:06:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-04 12:06:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-04 12:06:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-04 12:06:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-04 12:06:35,718 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-04 12:06:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:35,718 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-04 12:06:35,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-04 12:06:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-04 12:06:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-04 12:06:35,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:35,719 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-04 12:06:35,719 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:35,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:35,719 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-04 12:06:35,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:35,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:35,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:06:35,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:35,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:39,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:39,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:39,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:39,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:39,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:39,408 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:06:39,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:39,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:06:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:39,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:39,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:50,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:50,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-04 12:06:50,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:50,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-04 12:06:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-04 12:06:50,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 12:06:50,953 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-04 12:06:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:51,140 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-04 12:06:51,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-04 12:06:51,140 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-04 12:06:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:51,141 INFO L225 Difference]: With dead ends: 107 [2018-12-04 12:06:51,141 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 12:06:51,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 12:06:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 12:06:51,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-04 12:06:51,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 12:06:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-04 12:06:51,145 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-04 12:06:51,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:51,145 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-04 12:06:51,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-04 12:06:51,146 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-04 12:06:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 12:06:51,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:51,146 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-04 12:06:51,147 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:51,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:51,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-04 12:06:51,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:51,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:51,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:51,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:51,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:51,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:54,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:54,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:54,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:54,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:54,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:54,865 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:06:54,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:06:54,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:06:57,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-04 12:06:57,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:57,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:57,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:08,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:08,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-04 12:07:08,611 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:08,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-04 12:07:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-04 12:07:08,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 12:07:08,614 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-04 12:07:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:08,962 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-04 12:07:08,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-04 12:07:08,963 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-04 12:07:08,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:08,964 INFO L225 Difference]: With dead ends: 108 [2018-12-04 12:07:08,964 INFO L226 Difference]: Without dead ends: 106 [2018-12-04 12:07:08,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 12:07:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-04 12:07:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-04 12:07:08,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-04 12:07:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-04 12:07:08,968 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-04 12:07:08,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:08,968 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-04 12:07:08,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-04 12:07:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-04 12:07:08,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-04 12:07:08,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:08,969 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-04 12:07:08,970 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:08,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:08,970 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-04 12:07:08,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:08,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:08,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:07:08,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:08,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:13,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:13,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:13,104 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:13,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:13,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:13,104 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:07:13,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:07:13,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:07:13,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:07:13,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:07:13,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:13,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:25,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:25,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-04 12:07:25,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:25,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-04 12:07:25,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-04 12:07:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 12:07:25,035 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-04 12:07:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:25,355 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-04 12:07:25,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-04 12:07:25,356 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-04 12:07:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:25,356 INFO L225 Difference]: With dead ends: 109 [2018-12-04 12:07:25,356 INFO L226 Difference]: Without dead ends: 107 [2018-12-04 12:07:25,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 12:07:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-04 12:07:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-04 12:07:25,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-04 12:07:25,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-04 12:07:25,360 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-04 12:07:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:25,361 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-04 12:07:25,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-04 12:07:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-04 12:07:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-04 12:07:25,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:25,362 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-04 12:07:25,362 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:25,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:25,362 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-04 12:07:25,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:25,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:07:25,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:25,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:29,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:29,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:29,615 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:29,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:29,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:29,616 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:07:29,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:07:29,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:07:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:29,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:29,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:41,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:41,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-04 12:07:41,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:41,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-04 12:07:41,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-04 12:07:41,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-04 12:07:41,861 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-04 12:07:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:42,106 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-04 12:07:42,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-04 12:07:42,111 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-04 12:07:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:42,112 INFO L225 Difference]: With dead ends: 110 [2018-12-04 12:07:42,112 INFO L226 Difference]: Without dead ends: 108 [2018-12-04 12:07:42,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-04 12:07:42,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-04 12:07:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-04 12:07:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-04 12:07:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-04 12:07:42,116 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-04 12:07:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:42,116 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-04 12:07:42,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-04 12:07:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-04 12:07:42,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-04 12:07:42,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:42,117 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-04 12:07:42,117 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:42,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:42,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-04 12:07:42,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:42,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:42,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:07:42,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:42,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:46,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:46,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:46,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:46,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:46,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:46,075 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:07:46,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:07:46,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:07:48,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-04 12:07:48,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:07:48,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:48,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:00,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:00,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:00,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-04 12:08:00,420 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:00,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 12:08:00,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 12:08:00,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-04 12:08:00,422 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-04 12:08:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:00,676 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-04 12:08:00,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-04 12:08:00,676 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-04 12:08:00,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:00,677 INFO L225 Difference]: With dead ends: 111 [2018-12-04 12:08:00,677 INFO L226 Difference]: Without dead ends: 109 [2018-12-04 12:08:00,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-04 12:08:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-04 12:08:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-04 12:08:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-04 12:08:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-04 12:08:00,680 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-04 12:08:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:00,681 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-04 12:08:00,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 12:08:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-04 12:08:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-04 12:08:00,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:00,681 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-04 12:08:00,682 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:00,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-04 12:08:00,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:00,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:08:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:00,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:04,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:04,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:04,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:04,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:04,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:04,897 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:08:04,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:08:04,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:08:04,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:08:04,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:08:04,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:04,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:17,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:17,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-04 12:08:17,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:17,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-04 12:08:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-04 12:08:17,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-04 12:08:17,220 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-04 12:08:17,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:17,527 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-04 12:08:17,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-04 12:08:17,527 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-04 12:08:17,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:17,528 INFO L225 Difference]: With dead ends: 112 [2018-12-04 12:08:17,528 INFO L226 Difference]: Without dead ends: 110 [2018-12-04 12:08:17,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-04 12:08:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-04 12:08:17,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-04 12:08:17,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-04 12:08:17,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-04 12:08:17,531 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-04 12:08:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:17,531 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-04 12:08:17,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-04 12:08:17,532 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-04 12:08:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-04 12:08:17,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:17,532 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-04 12:08:17,532 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:17,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:17,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-04 12:08:17,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:17,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:17,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:08:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:17,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:21,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:21,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:21,657 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:21,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:21,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:21,657 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:08:21,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:08:21,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:08:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:21,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:21,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:34,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:34,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-04 12:08:34,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:34,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-04 12:08:34,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-04 12:08:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-04 12:08:34,376 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-04 12:08:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:34,668 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-04 12:08:34,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-04 12:08:34,669 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-04 12:08:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:34,669 INFO L225 Difference]: With dead ends: 113 [2018-12-04 12:08:34,669 INFO L226 Difference]: Without dead ends: 111 [2018-12-04 12:08:34,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-04 12:08:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-04 12:08:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-04 12:08:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-04 12:08:34,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-04 12:08:34,673 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-04 12:08:34,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:34,674 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-04 12:08:34,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-04 12:08:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-04 12:08:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-04 12:08:34,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:34,675 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-04 12:08:34,675 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:34,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-04 12:08:34,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:34,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:08:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:34,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:39,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:39,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:39,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:39,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:39,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:39,064 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:08:39,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:08:39,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:08:41,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-04 12:08:41,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:08:41,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:42,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:54,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:54,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-04 12:08:54,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:54,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-04 12:08:54,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-04 12:08:54,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-04 12:08:54,984 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-04 12:08:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:55,349 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-04 12:08:55,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-04 12:08:55,349 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-04 12:08:55,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:55,350 INFO L225 Difference]: With dead ends: 114 [2018-12-04 12:08:55,350 INFO L226 Difference]: Without dead ends: 112 [2018-12-04 12:08:55,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-04 12:08:55,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-04 12:08:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-04 12:08:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-04 12:08:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-04 12:08:55,353 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-04 12:08:55,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:55,353 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-04 12:08:55,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-04 12:08:55,353 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-04 12:08:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-04 12:08:55,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:55,354 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-04 12:08:55,354 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:55,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:55,354 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-04 12:08:55,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:55,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:08:55,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:55,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:59,901 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:59,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:59,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:59,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:59,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:59,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:59,902 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:08:59,910 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:08:59,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:08:59,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:08:59,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:08:59,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:00,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:09:12,919 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:12,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:09:12,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-04 12:09:12,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:09:12,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-04 12:09:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-04 12:09:12,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-04 12:09:12,941 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-04 12:09:13,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:09:13,228 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-04 12:09:13,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-04 12:09:13,229 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-04 12:09:13,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:09:13,230 INFO L225 Difference]: With dead ends: 115 [2018-12-04 12:09:13,230 INFO L226 Difference]: Without dead ends: 113 [2018-12-04 12:09:13,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-04 12:09:13,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-04 12:09:13,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-04 12:09:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-04 12:09:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-04 12:09:13,235 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-04 12:09:13,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:09:13,235 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-04 12:09:13,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-04 12:09:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-04 12:09:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-04 12:09:13,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:09:13,236 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-04 12:09:13,236 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:09:13,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:09:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-04 12:09:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:09:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:13,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:09:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:13,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:09:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:17,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:17,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:09:17,866 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:09:17,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:09:17,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:17,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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:09:17,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:09:17,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:09:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:17,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:17,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:09:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:09:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-04 12:09:31,480 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:09:31,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-04 12:09:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-04 12:09:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-04 12:09:31,483 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-04 12:09:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:09:31,729 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-04 12:09:31,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-04 12:09:31,729 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-04 12:09:31,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:09:31,730 INFO L225 Difference]: With dead ends: 116 [2018-12-04 12:09:31,730 INFO L226 Difference]: Without dead ends: 114 [2018-12-04 12:09:31,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-04 12:09:31,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-04 12:09:31,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-04 12:09:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-04 12:09:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-04 12:09:31,734 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-04 12:09:31,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:09:31,734 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-04 12:09:31,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-04 12:09:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-04 12:09:31,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-04 12:09:31,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:09:31,735 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-04 12:09:31,735 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:09:31,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:09:31,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2018-12-04 12:09:31,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:09:31,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:31,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:09:31,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:31,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:09:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:36,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:36,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:09:36,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:09:36,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:09:36,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:36,498 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-04 12:09:36,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:09:36,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)