java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:22:47,539 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:22:47,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:22:47,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:22:47,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:22:47,555 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:22:47,556 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:22:47,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:22:47,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:22:47,563 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:22:47,565 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:22:47,572 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:22:47,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:22:47,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:22:47,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:22:47,579 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:22:47,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:22:47,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:22:47,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:22:47,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:22:47,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:22:47,590 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:22:47,592 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:22:47,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:22:47,592 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:22:47,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:22:47,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:22:47,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:22:47,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:22:47,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:22:47,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:22:47,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:22:47,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:22:47,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:22:47,600 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:22:47,601 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:22:47,601 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:22:47,613 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:22:47,614 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:22:47,614 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:22:47,615 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:22:47,615 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:22:47,615 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:22:47,615 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:22:47,616 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:22:47,616 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:22:47,616 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:22:47,616 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:22:47,616 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:22:47,617 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:22:47,617 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:22:47,617 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:22:47,618 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:22:47,618 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:22:47,618 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:22:47,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:22:47,619 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:22:47,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:22:47,619 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:22:47,619 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:22:47,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:22:47,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:22:47,620 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:22:47,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:22:47,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:22:47,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:22:47,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:22:47,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:22:47,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:22:47,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:22:47,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:22:47,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:22:47,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:22:47,622 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:22:47,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:22:47,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:22:47,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:22:47,623 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:22:47,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:22:47,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:22:47,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:22:47,677 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:22:47,677 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:22:47,678 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl [2018-12-03 15:22:47,678 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl' [2018-12-03 15:22:47,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:22:47,729 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:22:47,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:47,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:22:47,730 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:22:47,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,770 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:47,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:22:47,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:22:47,771 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:22:47,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... [2018-12-03 15:22:47,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:22:47,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:22:47,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:22:47,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:22:47,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:22:47,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:22:47,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:22:48,075 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:22:48,075 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:22:48,076 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:48 BoogieIcfgContainer [2018-12-03 15:22:48,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:22:48,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:22:48,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:22:48,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:22:48,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:47" (1/2) ... [2018-12-03 15:22:48,082 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40559bf8 and model type const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:22:48, skipping insertion in model container [2018-12-03 15:22:48,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:48" (2/2) ... [2018-12-03 15:22:48,084 INFO L112 eAbstractionObserver]: Analyzing ICFG const1.i_3.bpl [2018-12-03 15:22:48,095 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:22:48,106 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:22:48,125 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:22:48,165 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:22:48,165 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:22:48,165 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:22:48,165 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:22:48,166 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:22:48,166 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:22:48,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:22:48,166 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:22:48,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:22:48,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:22:48,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:48,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:22:48,204 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:48,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:22:48,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:48,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:48,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:48,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:48,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:48,795 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 15:22:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:48,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:48,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:48,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:48,821 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:22:48,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:48,861 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:22:48,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:48,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:22:48,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:48,874 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:22:48,874 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:22:48,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:22:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:22:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:22:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:22:48,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:22:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:48,913 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:22:48,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:22:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:22:48,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:48,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:22:48,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:48,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 15:22:48,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:48,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:48,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:48,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:49,071 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-03 15:22:49,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:49,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:49,073 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:22:49,075 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:22:49,115 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:22:49,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:22:49,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:22:49,297 INFO L272 AbstractInterpreter]: Visited 4 different actions 8 times. Merged at 1 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:22:49,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:49,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:22:49,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:49,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:49,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:49,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:49,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:49,596 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-03 15:22:49,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:49,826 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-03 15:22:49,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:49,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 15:22:49,846 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:49,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:22:49,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:22:49,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:22:49,848 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 15:22:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:49,911 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:22:49,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:22:49,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 15:22:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:49,913 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:22:49,913 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:22:49,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:22:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:22:49,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:22:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:22:49,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:22:49,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:22:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:49,918 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:22:49,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:22:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:22:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:22:49,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:49,919 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:22:49,919 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:49,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:49,920 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 15:22:49,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:49,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:49,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:49,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:49,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:50,233 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:22:50,234 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-03 15:22:50,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:50,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:50,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:50,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:50,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:50,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:50,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:50,256 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:50,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:22:50,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:50,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:50,388 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-03 15:22:50,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:50,448 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-03 15:22:50,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 15:22:50,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:50,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:22:50,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:22:50,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:22:50,469 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 15:22:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:50,511 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:22:50,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:50,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 15:22:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:50,513 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:22:50,513 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:22:50,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:22:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:22:50,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:22:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:22:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:22:50,517 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:22:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:50,517 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:22:50,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:22:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:22:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:22:50,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:50,518 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:22:50,518 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:50,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:50,519 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 15:22:50,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:50,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:50,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:50,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:50,783 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:22:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:50,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:50,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:50,784 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:50,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:50,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:50,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:50,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:50,794 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:50,802 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:50,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:50,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:50,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:51,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:51,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 15:22:51,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:51,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:22:51,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:22:51,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:22:51,761 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 15:22:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:51,818 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:22:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:22:51,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 15:22:51,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:51,819 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:22:51,819 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:22:51,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:22:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:22:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:22:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:22:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:22:51,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:22:51,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:51,823 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:22:51,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:22:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:22:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:22:51,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:51,825 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:22:51,825 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:51,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 15:22:51,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:51,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:51,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:51,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:52,300 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:22:52,302 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-03 15:22:52,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:52,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:52,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:52,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:52,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:52,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:52,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:52,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:52,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:52,374 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-03 15:22:52,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:52,887 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-03 15:22:52,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:52,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 15:22:52,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:52,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:22:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:22:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:22:52,911 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 15:22:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:52,959 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:22:52,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:22:52,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 15:22:52,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:52,962 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:22:52,963 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:22:52,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:22:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:22:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:22:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:22:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:22:52,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:22:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:52,967 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:22:52,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:22:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:22:52,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:22:52,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:52,968 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:22:52,968 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:52,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:52,968 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 15:22:52,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:52,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:52,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:52,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:52,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:53,140 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-03 15:22:53,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:53,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:53,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:53,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:53,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:53,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:53,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:53,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:53,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:22:53,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:53,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:53,279 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-03 15:22:53,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:56,113 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-03 15:22:56,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:56,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 15:22:56,132 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:56,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:22:56,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:22:56,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:22:56,133 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 15:22:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:56,202 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:22:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:22:56,203 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 15:22:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:56,204 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:22:56,204 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:22:56,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:22:56,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:22:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:22:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:22:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:22:56,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:22:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:56,209 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:22:56,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:22:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:22:56,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:22:56,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:56,210 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:22:56,210 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:56,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:56,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 15:22:56,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:56,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:56,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:56,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:56,461 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-03 15:22:56,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:56,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:56,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:56,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:56,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:56,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:56,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:56,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:56,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:56,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:56,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:56,522 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-03 15:22:56,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:59,810 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-03 15:22:59,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:59,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:22:59,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:59,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:22:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:22:59,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:22:59,831 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 15:22:59,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:59,916 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:22:59,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:22:59,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 15:22:59,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:59,917 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:22:59,917 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:22:59,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:22:59,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:22:59,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:22:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:22:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:22:59,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:22:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:59,922 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:22:59,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:22:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:22:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:22:59,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:59,923 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:22:59,924 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:59,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:59,924 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 15:22:59,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:59,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:59,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:59,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:59,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:00,221 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-03 15:23:00,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:00,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:00,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:00,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:00,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:00,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:00,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:00,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:00,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:00,272 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-03 15:23:00,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:02,899 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-03 15:23:02,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:02,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 15:23:02,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:02,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:23:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:23:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:23:02,921 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 15:23:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:03,091 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:23:03,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:23:03,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 15:23:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:03,092 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:23:03,092 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:23:03,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:23:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:23:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:23:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:23:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:23:03,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:23:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:03,097 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:23:03,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:23:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:23:03,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:23:03,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:03,097 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:23:03,098 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:03,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:03,098 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 15:23:03,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:03,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:03,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:03,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:03,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:03,364 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-03 15:23:03,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:03,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:03,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:03,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:03,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:03,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:03,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:03,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:03,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:23:03,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:03,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:03,485 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-03 15:23:03,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:10,278 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-03 15:23:10,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:10,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 15:23:10,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:10,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:23:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:23:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:23:10,305 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 15:23:10,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:10,404 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:23:10,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:23:10,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 15:23:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:10,405 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:23:10,405 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:23:10,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:23:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:23:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:23:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:23:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:23:10,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 15:23:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:10,410 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:23:10,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:23:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:23:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:23:10,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:10,411 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:23:10,411 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:10,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:10,411 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 15:23:10,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:10,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:10,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:10,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:10,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:10,627 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-03 15:23:10,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:10,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:10,628 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:10,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:10,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:10,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:10,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:10,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:10,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:10,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:10,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:10,706 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-03 15:23:10,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:17,728 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-03 15:23:17,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:17,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 15:23:17,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:17,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:23:17,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:23:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:23:17,762 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 15:23:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:17,894 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 15:23:17,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:23:17,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 15:23:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:17,895 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:23:17,895 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:23:17,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:23:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:23:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:23:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:23:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:23:17,899 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 15:23:17,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:17,899 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:23:17,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:23:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:23:17,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:23:17,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:17,900 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 15:23:17,900 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:17,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 15:23:17,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:17,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:17,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:17,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:17,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:18,223 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-03 15:23:18,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:18,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:18,224 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:18,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:18,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:18,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:18,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:18,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:18,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:18,275 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-03 15:23:18,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:28,779 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-03 15:23:28,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:28,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 15:23:28,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:28,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:23:28,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:23:28,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:23:28,800 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 15:23:28,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:28,924 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:23:28,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:23:28,925 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 15:23:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:28,926 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:23:28,926 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:23:28,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:23:28,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:23:28,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:23:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:23:28,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:23:28,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 15:23:28,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:28,932 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:23:28,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:23:28,932 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:23:28,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:23:28,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:28,933 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 15:23:28,933 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:28,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:28,934 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 15:23:28,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:28,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:28,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:28,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:29,261 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-03 15:23:29,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:29,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:29,262 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:29,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:29,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:29,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:29,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:29,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:29,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:23:29,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:29,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:29,407 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-03 15:23:29,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:41,746 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-03 15:23:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 15:23:41,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:41,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:23:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:23:41,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:23:41,768 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 15:23:42,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:42,499 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 15:23:42,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:23:42,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 15:23:42,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:42,501 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:23:42,501 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:23:42,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:23:42,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:23:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:23:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:23:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:23:42,506 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 15:23:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:42,506 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:23:42,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:23:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:23:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:23:42,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:42,507 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 15:23:42,507 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:42,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:42,507 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 15:23:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:42,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:42,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:42,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:43,126 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-03 15:23:43,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:43,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:43,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:43,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:43,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:43,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:43,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:43,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:43,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:43,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:43,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:43,276 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-03 15:23:43,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:56,129 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-03 15:23:56,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:56,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 15:23:56,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:56,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:23:56,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:23:56,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:23:56,162 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 15:23:56,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:56,469 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:23:56,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:23:56,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 15:23:56,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:56,471 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:23:56,471 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:23:56,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:23:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:23:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:23:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:23:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 15:23:56,478 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 15:23:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:56,478 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 15:23:56,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:23:56,478 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 15:23:56,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:23:56,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:56,479 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 15:23:56,479 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:56,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:56,479 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 15:23:56,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:56,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:56,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:56,772 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-03 15:23:56,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:56,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:56,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:56,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:56,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:56,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:56,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:56,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:56,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:57,047 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-03 15:23:57,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:12,045 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-03 15:24:12,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:12,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 15:24:12,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:12,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:24:12,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:24:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:24:12,066 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 15:24:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:12,265 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 15:24:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:24:12,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:24:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:12,267 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:24:12,267 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:24:12,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:24:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:24:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:24:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:24:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:24:12,272 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 15:24:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:12,272 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:24:12,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:24:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:24:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:24:12,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:12,273 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 15:24:12,273 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:12,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 15:24:12,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:12,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:12,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:12,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:12,704 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-03 15:24:12,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:12,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:12,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:12,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:12,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:12,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:12,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:12,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:12,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:24:12,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:12,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:12,912 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-03 15:24:12,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:13,347 WARN L180 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 15:24:14,502 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:16,304 WARN L180 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:18,447 WARN L180 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:20,240 WARN L180 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:23,268 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:26,020 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:29,448 WARN L180 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:31,343 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:33,455 WARN L180 SmtUtils]: Spent 763.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:36,154 WARN L180 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:24:36,384 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-03 15:24:36,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:36,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 15:24:36,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:36,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:24:36,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:24:36,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=737, Unknown=1, NotChecked=0, Total=1056 [2018-12-03 15:24:36,405 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 15:24:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:36,599 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:24:36,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:24:36,600 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 15:24:36,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:36,601 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:24:36,601 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:24:36,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=318, Invalid=737, Unknown=1, NotChecked=0, Total=1056 [2018-12-03 15:24:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:24:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:24:36,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:24:36,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:24:36,606 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 15:24:36,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:36,607 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:24:36,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:24:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:24:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:24:36,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:36,607 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 15:24:36,608 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:36,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:36,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 15:24:36,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:36,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:36,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:36,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:36,931 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-03 15:24:36,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:36,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:36,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:36,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:36,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:36,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:36,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:36,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:36,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:36,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:36,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:37,004 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-03 15:24:37,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:57,838 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-03 15:24:57,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:57,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 15:24:57,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:57,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:24:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:24:57,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:24:57,864 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 15:24:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:58,082 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 15:24:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:24:58,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 15:24:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:58,084 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:24:58,084 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:24:58,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:24:58,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:24:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:24:58,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:24:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:24:58,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 15:24:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:58,089 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:24:58,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:24:58,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:24:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:24:58,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:58,090 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 15:24:58,090 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:58,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:58,090 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 15:24:58,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:58,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:58,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:58,362 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-03 15:24:58,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:58,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:58,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:58,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:58,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:58,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:58,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:58,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:58,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:58,481 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-03 15:24:58,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:21,298 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-03 15:25:21,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:21,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 15:25:21,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:21,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:25:21,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:25:21,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:25:21,318 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 15:25:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:21,604 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:25:21,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:25:21,606 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 15:25:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:21,607 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:25:21,607 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:25:21,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:25:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:25:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:25:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:25:21,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 15:25:21,612 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 15:25:21,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:21,612 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 15:25:21,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:25:21,612 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 15:25:21,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:25:21,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:21,613 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 15:25:21,613 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:21,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:21,613 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 15:25:21,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:21,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:21,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:21,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:21,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:22,264 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-03 15:25:22,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:22,264 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:22,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:22,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:22,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:22,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:25:22,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:25:26,592 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:25:26,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:26,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:26,841 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-03 15:25:26,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:53,062 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-03 15:25:53,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:53,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 15:25:53,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:53,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:25:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:25:53,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:25:53,083 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 15:25:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:53,391 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 15:25:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:25:53,392 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 15:25:53,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:53,393 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:25:53,393 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:25:53,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:25:53,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:25:53,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:25:53,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:25:53,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:25:53,399 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 15:25:53,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:53,400 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:25:53,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:25:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:25:53,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:25:53,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:53,401 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 15:25:53,401 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:53,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:53,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 15:25:53,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:53,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:53,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:53,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:53,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:53,837 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-03 15:25:53,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:53,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:53,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:53,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:53,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:53,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:25:53,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:25:53,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:25:53,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:25:53,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:53,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:54,015 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-03 15:25:54,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:28,731 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-03 15:26:28,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:28,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 15:26:28,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:28,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:26:28,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:26:28,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:26:28,752 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 15:26:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:29,014 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:26:29,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:26:29,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 15:26:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:29,015 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:26:29,016 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:26:29,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:26:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:26:29,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:26:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:26:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:26:29,021 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 15:26:29,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:29,022 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:26:29,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:26:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:26:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:26:29,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:29,023 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 15:26:29,023 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:29,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:29,023 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 15:26:29,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:29,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:29,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:29,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:29,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:29,374 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-03 15:26:29,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:29,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:29,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:29,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:29,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:29,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:26:29,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:29,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:29,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:29,465 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-03 15:26:29,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:01,485 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-03 15:27:01,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:01,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 15:27:01,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:01,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:27:01,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:27:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:27:01,507 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 15:27:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:02,037 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 15:27:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:27:02,038 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 15:27:02,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:02,039 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:27:02,039 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:27:02,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:27:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:27:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:27:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:27:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:27:02,044 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 15:27:02,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:02,044 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:27:02,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:27:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:27:02,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:27:02,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:02,045 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 15:27:02,045 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:02,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 15:27:02,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:02,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:02,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:02,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:02,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:02,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:02,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:02,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:02,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:02,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:02,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:02,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:04,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:27:04,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:04,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:04,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:41,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:41,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 15:27:41,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:41,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:27:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:27:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:27:41,851 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 15:27:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:42,295 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:27:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:27:42,295 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 15:27:42,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:42,296 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:27:42,296 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:27:42,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=570, Invalid=1410, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:27:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:27:42,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:27:42,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:27:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:27:42,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 15:27:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:42,302 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:27:42,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:27:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:27:42,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:27:42,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:42,303 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 15:27:42,304 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:42,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:42,304 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 15:27:42,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:42,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:42,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:42,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:42,774 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-03 15:27:42,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:42,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:42,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:42,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:42,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:42,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:27:42,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:42,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:42,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:42,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:42,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:42,976 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-03 15:27:42,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:26,257 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-03 15:28:26,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:26,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 15:28:26,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:26,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:28:26,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:28:26,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:28:26,280 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 15:28:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:26,618 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 15:28:26,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:28:26,620 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 15:28:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:26,620 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:28:26,620 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:28:26,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:28:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:28:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:28:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:28:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:28:26,625 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 15:28:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:26,625 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:28:26,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:28:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:28:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:28:26,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:26,626 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 15:28:26,626 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:26,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 15:28:26,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:26,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:26,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:27,353 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-03 15:28:27,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:27,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:27,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:27,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:27,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:27,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:28:27,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:27,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:28:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:27,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:27,421 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-03 15:28:27,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:09,339 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-03 15:29:09,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:09,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 15:29:09,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:09,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:29:09,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:29:09,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:29:09,359 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 15:29:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:10,208 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:29:10,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:29:10,208 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 15:29:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:10,209 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:29:10,209 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:29:10,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:29:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:29:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:29:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:29:10,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:29:10,214 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 15:29:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:10,215 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:29:10,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:29:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:29:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:29:10,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:10,216 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 15:29:10,216 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:10,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 15:29:10,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:10,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:10,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:10,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:10,813 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-03 15:29:10,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:10,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:10,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:10,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:10,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:10,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:29:10,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:29:10,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:29:11,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:29:11,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:11,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:11,652 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-03 15:29:11,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:06,128 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-03 15:30:06,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:06,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 15:30:06,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:06,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:30:06,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:30:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:30:06,149 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 15:30:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:06,828 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 15:30:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:30:06,829 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 15:30:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:06,829 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:30:06,830 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:30:06,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 55.1s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:30:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:30:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:30:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:30:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:30:06,836 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 15:30:06,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:06,836 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:30:06,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:30:06,836 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:30:06,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:30:06,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:06,837 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 15:30:06,837 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:06,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:06,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 15:30:06,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:06,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:06,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:06,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:07,385 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-03 15:30:07,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:07,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:07,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:07,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:07,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:07,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:30:07,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:30:07,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:30:07,416 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:30:07,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:07,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:07,474 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-03 15:30:07,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:05,004 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-03 15:31:05,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:05,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 15:31:05,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:05,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:31:05,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:31:05,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:31:05,024 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 15:31:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:05,468 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:31:05,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:31:05,469 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 15:31:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:05,470 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:31:05,470 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:31:05,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 58.0s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:31:05,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:31:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:31:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:31:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 15:31:05,476 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 15:31:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:05,476 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 15:31:05,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:31:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 15:31:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:31:05,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:05,477 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 15:31:05,477 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:05,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:05,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 15:31:05,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:05,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:31:05,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:05,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:07,058 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-03 15:31:07,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:07,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:07,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:07,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:07,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:07,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:31:07,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:31:07,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:31:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:07,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:07,210 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-03 15:31:07,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:06,842 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-03 15:32:06,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:06,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 15:32:06,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:32:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:32:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:32:06,863 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 15:32:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:07,342 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 15:32:07,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:32:07,343 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 15:32:07,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:07,344 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:32:07,344 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:32:07,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 61.2s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:32:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:32:07,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:32:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:32:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:32:07,348 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 15:32:07,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:07,349 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:32:07,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:32:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:32:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:32:07,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:07,349 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 15:32:07,350 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:07,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 15:32:07,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:07,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:07,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:08,405 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-03 15:32:08,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:08,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:08,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:08,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:08,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:08,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:32:08,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:32:08,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:32:11,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:32:11,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:11,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:11,094 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-03 15:32:11,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:19,135 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-03 15:33:19,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:19,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 15:33:19,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:19,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:33:19,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:33:19,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:33:19,156 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 15:33:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:19,694 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:33:19,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:33:19,696 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 15:33:19,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:19,697 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:33:19,697 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:33:19,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 69.0s TimeCoverageRelationStatistics Valid=894, Invalid=2298, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:33:19,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:33:19,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:33:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:33:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:33:19,702 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 15:33:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:19,703 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:33:19,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:33:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:33:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:33:19,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:19,704 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 15:33:19,704 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:19,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:19,705 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 15:33:19,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:19,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:19,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:19,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:20,389 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-03 15:33:20,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:20,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:20,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:20,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:20,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:20,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:33:20,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:20,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:20,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:20,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:20,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:20,484 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-03 15:33:20,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:29,965 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-03 15:34:29,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:29,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 15:34:29,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:29,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:34:29,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:34:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:34:29,986 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 15:34:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:30,555 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 15:34:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:34:30,555 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 15:34:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:30,556 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:34:30,556 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:34:30,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:34:30,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:34:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:34:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:34:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:34:30,562 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 15:34:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:30,562 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:34:30,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:34:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:34:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:34:30,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:30,563 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 15:34:30,563 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:30,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:30,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 15:34:30,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:30,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:30,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:30,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:30,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:32,061 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-03 15:34:32,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:32,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:32,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:32,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:32,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:32,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:32,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:32,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:32,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:32,144 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-03 15:34:32,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:40,838 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-03 15:35:40,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:40,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 15:35:40,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:40,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:35:40,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:35:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:35:40,858 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 15:35:41,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:41,421 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:35:41,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:35:41,421 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 15:35:41,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:41,422 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:35:41,422 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:35:41,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 70.1s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:35:41,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:35:41,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:35:41,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:35:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 15:35:41,427 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 15:35:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:41,427 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 15:35:41,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:35:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 15:35:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:35:41,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:41,430 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 15:35:41,430 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:41,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 15:35:41,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:41,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:41,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:42,591 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-03 15:35:42,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:42,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:42,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:42,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:42,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:42,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:42,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:42,600 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:46,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:35:46,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:46,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:46,646 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-03 15:35:46,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:47,085 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 15:35:47,589 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-03 15:35:48,874 WARN L180 SmtUtils]: Spent 829.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:35:50,655 WARN L180 SmtUtils]: Spent 771.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:35:52,633 WARN L180 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:35:54,052 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:35:55,355 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:35:56,457 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:35:58,541 WARN L180 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:00,084 WARN L180 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:03,083 WARN L180 SmtUtils]: Spent 792.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:09,853 WARN L180 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:12,254 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:16,619 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:19,144 WARN L180 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:22,748 WARN L180 SmtUtils]: Spent 844.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:24,015 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:26,249 WARN L180 SmtUtils]: Spent 773.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:31,532 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:36,257 WARN L180 SmtUtils]: Spent 774.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:42,685 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:46,857 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:50,860 WARN L180 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:36:58,346 WARN L180 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:37:11,821 WARN L180 SmtUtils]: Spent 770.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:37:21,615 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:37:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 434 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:21,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:21,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 15:37:21,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:21,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:37:21,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:37:21,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2807, Unknown=16, NotChecked=0, Total=3906 [2018-12-03 15:37:21,641 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 15:37:22,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:22,328 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 15:37:22,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:37:22,328 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 15:37:22,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:22,329 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:37:22,329 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:37:22,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 96.1s TimeCoverageRelationStatistics Valid=1083, Invalid=2807, Unknown=16, NotChecked=0, Total=3906 [2018-12-03 15:37:22,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:37:22,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:37:22,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:37:22,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:37:22,334 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 15:37:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:22,334 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:37:22,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:37:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:37:22,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:37:22,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:22,334 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 15:37:22,335 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:22,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 15:37:22,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:22,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:22,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:22,336 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:23,211 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-03 15:37:23,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:23,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:23,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:23,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:23,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:23,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:23,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:37:23,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:37:23,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:37:23,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:23,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:23,303 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-03 15:37:23,304 INFO L316 TraceCheckSpWp]: Computing backward predicates...