java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:10:29,805 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:10:29,807 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:10:29,818 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:10:29,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:10:29,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:10:29,821 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:10:29,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:10:29,825 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:10:29,826 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:10:29,826 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:10:29,827 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:10:29,828 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:10:29,829 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:10:29,830 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:10:29,831 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:10:29,832 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:10:29,834 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:10:29,836 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:10:29,838 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:10:29,839 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:10:29,840 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:10:29,842 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:10:29,842 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:10:29,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:10:29,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:10:29,845 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:10:29,845 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:10:29,846 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:10:29,847 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:10:29,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:10:29,848 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:10:29,849 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:10:29,849 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:10:29,851 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:10:29,852 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:10:29,852 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:10:29,875 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:10:29,877 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:10:29,878 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:10:29,878 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:10:29,878 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:10:29,879 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:10:29,879 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:10:29,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:10:29,879 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:10:29,879 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:10:29,879 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:10:29,880 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:10:29,883 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:10:29,883 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:10:29,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:10:29,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:10:29,884 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:10:29,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:10:29,885 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:10:29,886 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:10:29,887 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:10:29,887 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:10:29,887 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:10:29,887 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:10:29,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:10:29,888 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:10:29,888 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:10:29,888 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:10:29,888 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:10:29,888 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:10:29,889 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:10:29,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:29,889 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:10:29,889 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:10:29,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:10:29,890 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:10:29,890 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:10:29,890 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:10:29,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:10:29,890 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:10:29,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:10:29,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:10:29,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:10:29,940 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:10:29,940 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:10:29,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-02-25 15:10:29,942 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-02-25 15:10:29,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:10:29,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:10:29,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:29,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:10:29,980 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:10:29,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:30,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:10:30,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:10:30,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:10:30,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,035 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/1) ... [2019-02-25 15:10:30,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:10:30,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:10:30,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:10:30,038 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:10:30,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (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 [2019-02-25 15:10:30,105 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-02-25 15:10:30,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:10:30,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:10:30,342 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:10:30,342 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-25 15:10:30,343 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:30 BoogieIcfgContainer [2019-02-25 15:10:30,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:10:30,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:10:30,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:10:30,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:10:30,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:29" (1/2) ... [2019-02-25 15:10:30,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40274b10 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:30, skipping insertion in model container [2019-02-25 15:10:30,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:30" (2/2) ... [2019-02-25 15:10:30,351 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-02-25 15:10:30,360 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:10:30,368 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:10:30,384 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:10:30,416 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:10:30,416 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:10:30,416 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:10:30,416 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:10:30,416 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:10:30,417 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:10:30,417 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:10:30,417 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:10:30,432 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-02-25 15:10:30,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:10:30,438 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:30,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:10:30,441 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:30,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:30,448 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-02-25 15:10:30,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:30,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:30,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:30,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:10:30,718 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:30,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:30,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:30,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:10:30,744 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-02-25 15:10:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:30,909 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-02-25 15:10:30,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:30,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-25 15:10:30,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:30,922 INFO L225 Difference]: With dead ends: 26 [2019-02-25 15:10:30,922 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:10:30,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:10:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:10:30,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-25 15:10:30,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:10:30,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-02-25 15:10:30,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-02-25 15:10:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:30,956 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-02-25 15:10:30,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-02-25 15:10:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:10:30,957 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:30,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:30,958 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:30,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:30,958 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-02-25 15:10:30,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:30,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:30,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:31,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:31,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-25 15:10:31,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:31,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:31,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:10:31,061 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-02-25 15:10:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:31,173 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-02-25 15:10:31,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:31,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-25 15:10:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:31,174 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:10:31,175 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:10:31,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:10:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:10:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-02-25 15:10:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:10:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-02-25 15:10:31,181 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-02-25 15:10:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:31,182 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-02-25 15:10:31,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-02-25 15:10:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:10:31,183 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:31,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:31,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:31,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-02-25 15:10:31,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:10:31,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:31,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:10:31,258 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:31,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:10:31,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:10:31,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:31,260 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-02-25 15:10:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:31,297 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-02-25 15:10:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:10:31,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-25 15:10:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:31,298 INFO L225 Difference]: With dead ends: 24 [2019-02-25 15:10:31,298 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:10:31,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:10:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-25 15:10:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:10:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-25 15:10:31,302 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-02-25 15:10:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:31,302 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-25 15:10:31,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:10:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-25 15:10:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:10:31,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:31,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:31,304 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-02-25 15:10:31,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:31,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:31,589 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-25 15:10:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:31,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:31,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:31,649 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-25 15:10:31,651 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-02-25 15:10:31,691 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:31,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:31,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:31,817 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:10:31,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:31,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:31,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:31,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:31,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:31,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:31,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:10:31,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:32,175 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-02-25 15:10:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:32,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:32,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:32,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-02-25 15:10:32,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:32,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:10:32,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:10:32,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:10:32,292 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-25 15:10:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:32,536 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-02-25 15:10:32,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:10:32,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-02-25 15:10:32,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:32,539 INFO L225 Difference]: With dead ends: 26 [2019-02-25 15:10:32,539 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:10:32,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:10:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:10:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-25 15:10:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:10:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-02-25 15:10:32,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-02-25 15:10:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:32,545 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-02-25 15:10:32,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:10:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-02-25 15:10:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-25 15:10:32,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:32,548 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:32,548 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-02-25 15:10:32,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:32,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:32,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:32,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:32,745 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-02-25 15:10:32,745 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-02-25 15:10:32,748 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:32,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:32,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:32,798 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2019-02-25 15:10:32,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:32,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:32,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:32,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:32,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:32,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:10:32,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:32,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:32,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:32,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-02-25 15:10:32,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:32,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:10:32,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:10:32,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:32,982 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-02-25 15:10:33,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:33,360 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-02-25 15:10:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:10:33,361 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-02-25 15:10:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:33,361 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:10:33,362 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:10:33,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:10:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:10:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-02-25 15:10:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:10:33,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-02-25 15:10:33,367 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-02-25 15:10:33,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:33,367 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-02-25 15:10:33,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:10:33,367 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-02-25 15:10:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:10:33,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:33,368 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:10:33,369 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-02-25 15:10:33,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:33,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:33,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:33,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:33,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:33,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:33,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:33,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:10:33,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:33,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:10:33,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:33,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:33,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:33,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:33,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-02-25 15:10:33,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:33,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:10:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:10:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:10:33,854 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-02-25 15:10:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:34,127 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-02-25 15:10:34,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:10:34,128 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-02-25 15:10:34,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:34,129 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:10:34,130 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:10:34,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:10:34,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:10:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-02-25 15:10:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:10:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-02-25 15:10:34,135 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-02-25 15:10:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:34,136 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-02-25 15:10:34,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:10:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-02-25 15:10:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:10:34,137 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:34,137 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-25 15:10:34,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:34,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:34,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-02-25 15:10:34,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:34,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:34,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:34,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:34,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:34,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:34,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:34,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:34,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:34,342 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:34,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:34,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:10:34,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:34,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:34,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:34,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:34,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-02-25 15:10:34,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:34,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:10:34,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:10:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:10:34,452 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-02-25 15:10:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:34,566 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-02-25 15:10:34,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:10:34,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-25 15:10:34,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:34,568 INFO L225 Difference]: With dead ends: 45 [2019-02-25 15:10:34,568 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:10:34,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:10:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-02-25 15:10:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-25 15:10:34,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-02-25 15:10:34,574 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-02-25 15:10:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:34,574 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-02-25 15:10:34,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:10:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-02-25 15:10:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-25 15:10:34,575 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:34,575 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-25 15:10:34,575 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:34,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-02-25 15:10:34,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:34,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,818 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:34,818 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:34,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:34,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:34,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:34,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:34,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:10:34,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:35,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-02-25 15:10:35,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:35,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:10:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:10:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:35,109 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-02-25 15:10:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:35,682 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-02-25 15:10:35,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:10:35,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-02-25 15:10:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:35,683 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:10:35,683 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:10:35,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:10:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-02-25 15:10:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-25 15:10:35,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-02-25 15:10:35,689 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-02-25 15:10:35,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:35,690 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-02-25 15:10:35,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:10:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-02-25 15:10:35,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-25 15:10:35,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:35,691 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-25 15:10:35,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:35,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-02-25 15:10:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:35,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:35,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:35,811 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:35,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:35,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:35,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:35,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:35,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:10:35,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:35,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:10:35,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:35,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-02-25 15:10:35,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:35,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:10:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:10:35,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:35,972 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-02-25 15:10:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:36,224 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-02-25 15:10:36,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:10:36,225 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-02-25 15:10:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:36,226 INFO L225 Difference]: With dead ends: 60 [2019-02-25 15:10:36,226 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:10:36,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:10:36,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:10:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-02-25 15:10:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:10:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-02-25 15:10:36,234 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-02-25 15:10:36,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:36,234 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-02-25 15:10:36,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:10:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-02-25 15:10:36,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:10:36,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:36,235 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-25 15:10:36,235 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-02-25 15:10:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:36,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:36,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:36,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:36,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:36,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:36,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:36,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:36,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:36,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:36,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:10:36,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:36,609 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:36,663 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:36,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-02-25 15:10:36,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:36,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:10:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:10:36,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:10:36,683 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-02-25 15:10:37,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:37,461 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-02-25 15:10:37,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:10:37,465 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-02-25 15:10:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:37,466 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:10:37,466 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:10:37,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-02-25 15:10:37,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:10:37,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-25 15:10:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:10:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-02-25 15:10:37,474 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-02-25 15:10:37,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:37,474 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-02-25 15:10:37,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:10:37,475 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-02-25 15:10:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:10:37,475 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:37,476 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-25 15:10:37,476 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-02-25 15:10:37,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:37,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:37,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:37,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:37,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:37,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:37,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:10:37,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,165 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:38,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-02-25 15:10:38,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:38,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:10:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:10:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:10:38,275 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-02-25 15:10:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:38,599 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-02-25 15:10:38,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:10:38,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-02-25 15:10:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:38,600 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:10:38,601 INFO L226 Difference]: Without dead ends: 40 [2019-02-25 15:10:38,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:10:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-25 15:10:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-02-25 15:10:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:10:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-02-25 15:10:38,609 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-02-25 15:10:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:38,609 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-02-25 15:10:38,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:10:38,609 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-02-25 15:10:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-25 15:10:38,610 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:38,610 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-25 15:10:38,611 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:38,611 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-02-25 15:10:38,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:38,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:38,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:38,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:38,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:38,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:38,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:38,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-25 15:10:38,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:38,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:10:38,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:40,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:40,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-02-25 15:10:40,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:40,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:10:40,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:10:40,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:10:40,112 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-02-25 15:10:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:42,113 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-02-25 15:10:42,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:10:42,113 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-02-25 15:10:42,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:42,114 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:10:42,114 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 15:10:42,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:10:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 15:10:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-02-25 15:10:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:10:42,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-02-25 15:10:42,127 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-02-25 15:10:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:42,128 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-02-25 15:10:42,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:10:42,128 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-02-25 15:10:42,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:10:42,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:42,129 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-02-25 15:10:42,129 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:42,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:42,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-02-25 15:10:42,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:42,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:42,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:42,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:42,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:42,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:42,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:42,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:42,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:42,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:42,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:42,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:42,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:42,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:42,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:10:42,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:42,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-02-25 15:10:42,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:42,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:10:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:10:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:10:42,867 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-02-25 15:10:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:44,152 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-02-25 15:10:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:10:44,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-25 15:10:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:44,154 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:10:44,154 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:10:44,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:10:44,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:10:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-02-25 15:10:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:10:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-02-25 15:10:44,164 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-02-25 15:10:44,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:44,165 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-02-25 15:10:44,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:10:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-02-25 15:10:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:10:44,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:44,166 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-25 15:10:44,166 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-02-25 15:10:44,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:44,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:44,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:44,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:44,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:44,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:44,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:44,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:44,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:10:44,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:44,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-02-25 15:10:44,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:44,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:10:44,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:10:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:10:44,712 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-02-25 15:10:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:44,978 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-02-25 15:10:44,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:10:44,978 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-02-25 15:10:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:44,979 INFO L225 Difference]: With dead ends: 105 [2019-02-25 15:10:44,979 INFO L226 Difference]: Without dead ends: 54 [2019-02-25 15:10:44,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:10:44,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-25 15:10:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-02-25 15:10:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:10:44,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-02-25 15:10:44,989 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-02-25 15:10:44,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:44,989 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-02-25 15:10:44,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:10:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-02-25 15:10:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-25 15:10:44,990 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:44,990 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-25 15:10:44,991 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:44,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-02-25 15:10:44,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:45,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:45,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:45,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:45,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:45,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:45,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:45,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:45,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:10:45,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:45,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:10:45,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:45,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:45,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:45,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-02-25 15:10:45,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:45,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:10:45,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:10:45,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:45,662 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-02-25 15:10:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:47,047 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-02-25 15:10:47,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:10:47,048 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-02-25 15:10:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:47,049 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:10:47,049 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:10:47,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:10:47,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:10:47,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-02-25 15:10:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-25 15:10:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-02-25 15:10:47,059 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-02-25 15:10:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:47,059 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-02-25 15:10:47,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:10:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-02-25 15:10:47,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-25 15:10:47,060 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:47,060 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-25 15:10:47,060 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:47,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:47,061 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-02-25 15:10:47,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:47,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:47,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:47,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:47,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:47,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:47,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:47,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:47,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:47,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:47,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:47,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:47,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:47,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:47,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:47,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:10:47,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:47,569 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:47,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:47,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:47,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-02-25 15:10:47,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:47,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:10:47,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:10:47,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:47,742 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-02-25 15:10:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:48,103 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-02-25 15:10:48,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:10:48,104 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-25 15:10:48,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:48,105 INFO L225 Difference]: With dead ends: 120 [2019-02-25 15:10:48,105 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:10:48,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:10:48,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:10:48,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-02-25 15:10:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:10:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-02-25 15:10:48,115 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-02-25 15:10:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:48,115 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-02-25 15:10:48,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:10:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-02-25 15:10:48,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:10:48,116 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:48,117 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-25 15:10:48,117 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-02-25 15:10:48,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:48,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:48,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:48,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:48,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:48,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:48,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:48,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:48,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:48,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:48,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:48,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:48,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:10:48,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:48,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:48,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:48,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-02-25 15:10:48,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:48,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:10:48,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:10:48,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:10:48,941 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-02-25 15:10:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:50,367 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-02-25 15:10:50,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:10:50,368 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-02-25 15:10:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:50,368 INFO L225 Difference]: With dead ends: 124 [2019-02-25 15:10:50,368 INFO L226 Difference]: Without dead ends: 94 [2019-02-25 15:10:50,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-02-25 15:10:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-25 15:10:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-02-25 15:10:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:10:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-02-25 15:10:50,379 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-02-25 15:10:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:50,380 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-02-25 15:10:50,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:10:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-02-25 15:10:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:10:50,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:50,381 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-25 15:10:50,381 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:50,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-02-25 15:10:50,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:50,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:50,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:50,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:50,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:50,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:50,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:50,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:50,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:50,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:50,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:50,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:50,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:50,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-25 15:10:50,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:50,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:10:50,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:50,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:51,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:51,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-02-25 15:10:51,300 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:51,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:10:51,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:10:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:10:51,301 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-02-25 15:10:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:51,801 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-02-25 15:10:51,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:10:51,802 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-02-25 15:10:51,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:51,802 INFO L225 Difference]: With dead ends: 135 [2019-02-25 15:10:51,803 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:10:51,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:51,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:10:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-02-25 15:10:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:10:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-02-25 15:10:51,812 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-02-25 15:10:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:51,813 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-02-25 15:10:51,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:10:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-02-25 15:10:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-25 15:10:51,814 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:51,814 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-25 15:10:51,814 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:51,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:51,814 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-02-25 15:10:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:51,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:51,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:52,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:52,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:52,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:52,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:52,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:52,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:52,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:52,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:52,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:10:52,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:52,631 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:52,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:52,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:52,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-02-25 15:10:52,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:52,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:10:52,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:10:52,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:52,696 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-02-25 15:10:54,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:54,506 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-02-25 15:10:54,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:10:54,507 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-02-25 15:10:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:54,508 INFO L225 Difference]: With dead ends: 139 [2019-02-25 15:10:54,508 INFO L226 Difference]: Without dead ends: 105 [2019-02-25 15:10:54,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-25 15:10:54,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-02-25 15:10:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-25 15:10:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-02-25 15:10:54,520 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-02-25 15:10:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:54,520 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-02-25 15:10:54,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:10:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-02-25 15:10:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-25 15:10:54,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:54,521 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-25 15:10:54,521 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:54,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:54,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-02-25 15:10:54,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:54,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:54,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:54,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:54,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:54,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:54,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:54,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:54,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:54,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:54,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:54,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:10:54,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:55,498 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:55,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:55,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:55,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-02-25 15:10:55,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:55,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:10:55,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:10:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:55,717 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-02-25 15:10:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:56,373 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-02-25 15:10:56,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:10:56,374 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-02-25 15:10:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:56,375 INFO L225 Difference]: With dead ends: 150 [2019-02-25 15:10:56,375 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:10:56,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:10:56,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:10:56,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-02-25 15:10:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:10:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-02-25 15:10:56,384 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-02-25 15:10:56,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:56,384 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-02-25 15:10:56,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:10:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-02-25 15:10:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:10:56,385 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:56,386 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-25 15:10:56,386 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-02-25 15:10:56,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:56,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:56,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:57,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:57,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:57,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:57,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:57,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:57,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:57,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:57,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:57,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:10:57,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:57,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:10:57,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:57,955 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:58,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:58,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-02-25 15:10:58,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:58,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:10:58,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:10:58,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:10:58,744 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-02-25 15:11:01,574 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-25 15:11:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:03,493 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-02-25 15:11:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:11:03,494 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-02-25 15:11:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:03,495 INFO L225 Difference]: With dead ends: 192 [2019-02-25 15:11:03,495 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:11:03,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:11:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:11:03,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-02-25 15:11:03,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:11:03,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-02-25 15:11:03,507 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-02-25 15:11:03,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:03,507 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-02-25 15:11:03,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:11:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-02-25 15:11:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-25 15:11:03,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:03,508 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-02-25 15:11:03,508 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:03,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-02-25 15:11:03,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:03,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:03,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:03,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:03,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:04,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:04,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:04,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:04,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:04,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:04,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:04,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:04,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:11:04,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:05,156 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:05,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:05,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-02-25 15:11:05,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:05,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:11:05,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:11:05,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:11:05,289 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-02-25 15:11:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:07,678 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-02-25 15:11:07,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:11:07,681 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-02-25 15:11:07,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:07,682 INFO L225 Difference]: With dead ends: 169 [2019-02-25 15:11:07,683 INFO L226 Difference]: Without dead ends: 127 [2019-02-25 15:11:07,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:11:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-25 15:11:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-02-25 15:11:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-25 15:11:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-02-25 15:11:07,693 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-02-25 15:11:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:07,693 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-02-25 15:11:07,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:11:07,693 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-02-25 15:11:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-25 15:11:07,694 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:07,694 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-25 15:11:07,694 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:07,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-02-25 15:11:07,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:07,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:07,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:07,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:07,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:08,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:08,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:08,007 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:08,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:08,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:08,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:08,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:08,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:08,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:11:08,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:08,316 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:08,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:08,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-02-25 15:11:08,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:08,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:11:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:11:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:11:08,550 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-02-25 15:11:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:09,062 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-02-25 15:11:09,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:11:09,063 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-02-25 15:11:09,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:09,064 INFO L225 Difference]: With dead ends: 180 [2019-02-25 15:11:09,064 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:11:09,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:11:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:11:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-02-25 15:11:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:11:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-02-25 15:11:09,076 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-02-25 15:11:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:09,077 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-02-25 15:11:09,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:11:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-02-25 15:11:09,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:11:09,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:09,078 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-25 15:11:09,078 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:09,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-02-25 15:11:09,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:09,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:09,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:09,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:09,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:09,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:09,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:09,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:09,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:09,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:09,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:09,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:09,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:09,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:11:09,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:09,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:11:09,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:10,823 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:12,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:12,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-02-25 15:11:12,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:12,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:11:12,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:11:12,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-02-25 15:11:12,170 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-02-25 15:11:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:18,246 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-02-25 15:11:18,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:11:18,247 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-02-25 15:11:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:18,248 INFO L225 Difference]: With dead ends: 230 [2019-02-25 15:11:18,248 INFO L226 Difference]: Without dead ends: 135 [2019-02-25 15:11:18,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-02-25 15:11:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-25 15:11:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-02-25 15:11:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-25 15:11:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-02-25 15:11:18,267 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-02-25 15:11:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:18,268 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-02-25 15:11:18,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:11:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-02-25 15:11:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-25 15:11:18,268 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:18,268 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-02-25 15:11:18,269 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-02-25 15:11:18,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:18,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:18,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:18,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:18,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:18,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:18,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:18,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:18,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:18,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:18,904 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:18,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:18,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:18,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:18,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:11:18,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:19,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:19,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:19,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-02-25 15:11:19,534 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:19,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:11:19,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:11:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:11:19,536 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-02-25 15:11:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:22,873 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-02-25 15:11:22,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:11:22,874 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-02-25 15:11:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:22,875 INFO L225 Difference]: With dead ends: 199 [2019-02-25 15:11:22,875 INFO L226 Difference]: Without dead ends: 149 [2019-02-25 15:11:22,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:11:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-25 15:11:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-02-25 15:11:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:11:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-02-25 15:11:22,890 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-02-25 15:11:22,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:22,890 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-02-25 15:11:22,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:11:22,890 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-02-25 15:11:22,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-25 15:11:22,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:22,891 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-25 15:11:22,891 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:22,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-02-25 15:11:22,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:22,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:22,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:22,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:22,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:23,256 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:23,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:23,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:23,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:23,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:23,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:23,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:23,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:23,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:23,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:11:23,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:23,623 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:23,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:24,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:24,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-02-25 15:11:24,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:24,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:11:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:11:24,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:11:24,408 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-02-25 15:11:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:25,059 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-02-25 15:11:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:11:25,060 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-02-25 15:11:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:25,060 INFO L225 Difference]: With dead ends: 210 [2019-02-25 15:11:25,060 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:11:25,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:11:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:11:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-02-25 15:11:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:11:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-02-25 15:11:25,075 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-02-25 15:11:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:25,075 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-02-25 15:11:25,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:11:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-02-25 15:11:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:11:25,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:25,076 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-25 15:11:25,076 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:25,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-02-25 15:11:25,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:25,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:25,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:25,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:25,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:25,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:25,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:25,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:25,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:25,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:25,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:25,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-25 15:11:25,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:25,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-25 15:11:25,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:26,760 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:26,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:26,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-02-25 15:11:26,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:26,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:11:26,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:11:26,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:11:26,948 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-02-25 15:11:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:30,413 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-02-25 15:11:30,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:11:30,414 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-02-25 15:11:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:30,415 INFO L225 Difference]: With dead ends: 214 [2019-02-25 15:11:30,415 INFO L226 Difference]: Without dead ends: 160 [2019-02-25 15:11:30,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-02-25 15:11:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-25 15:11:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-02-25 15:11:30,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:11:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-02-25 15:11:30,430 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-02-25 15:11:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:30,430 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-02-25 15:11:30,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:11:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-02-25 15:11:30,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:11:30,431 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:30,431 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-25 15:11:30,431 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:30,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-02-25 15:11:30,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:30,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:30,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:30,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:30,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:30,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:30,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:30,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:30,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:30,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:30,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:30,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:30,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:30,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:30,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:30,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:11:30,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:31,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:31,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:31,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-02-25 15:11:31,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:31,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:11:31,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:11:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:11:31,522 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-02-25 15:11:32,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:32,276 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-02-25 15:11:32,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:11:32,276 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-02-25 15:11:32,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:32,278 INFO L225 Difference]: With dead ends: 225 [2019-02-25 15:11:32,278 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:11:32,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:11:32,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:11:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-02-25 15:11:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-25 15:11:32,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-02-25 15:11:32,294 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-02-25 15:11:32,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:32,295 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-02-25 15:11:32,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:11:32,295 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-02-25 15:11:32,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-25 15:11:32,295 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:32,295 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-25 15:11:32,295 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:32,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:32,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-02-25 15:11:32,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:32,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:32,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:33,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:33,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:33,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:33,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:33,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:33,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:33,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:33,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:33,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-25 15:11:33,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:33,752 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:33,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:33,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-02-25 15:11:33,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:33,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:11:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:11:33,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:11:33,857 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-02-25 15:11:37,048 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-02-25 15:11:38,462 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-02-25 15:11:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:38,766 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-02-25 15:11:38,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:11:38,767 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-02-25 15:11:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:38,767 INFO L225 Difference]: With dead ends: 229 [2019-02-25 15:11:38,768 INFO L226 Difference]: Without dead ends: 171 [2019-02-25 15:11:38,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-25 15:11:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-02-25 15:11:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-25 15:11:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-02-25 15:11:38,793 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-02-25 15:11:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:38,793 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-02-25 15:11:38,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:11:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-02-25 15:11:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-25 15:11:38,794 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:38,794 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-25 15:11:38,794 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:38,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:38,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-02-25 15:11:38,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:38,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:38,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:38,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:38,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:39,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:39,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:39,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:39,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:39,379 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:39,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:39,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:11:39,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:39,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:11:39,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:39,905 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:40,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:40,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-02-25 15:11:40,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:40,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:11:40,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:11:40,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:11:40,239 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-02-25 15:11:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:40,806 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-02-25 15:11:40,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:11:40,806 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-02-25 15:11:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:40,807 INFO L225 Difference]: With dead ends: 240 [2019-02-25 15:11:40,807 INFO L226 Difference]: Without dead ends: 117 [2019-02-25 15:11:40,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:11:40,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-25 15:11:40,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-02-25 15:11:40,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-25 15:11:40,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-02-25 15:11:40,822 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-02-25 15:11:40,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:40,822 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-02-25 15:11:40,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:11:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-02-25 15:11:40,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-25 15:11:40,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:40,823 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-25 15:11:40,824 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:40,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:40,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-02-25 15:11:40,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:40,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:40,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:40,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:41,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:41,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:41,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:41,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:41,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:41,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:41,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:41,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:41,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:41,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:41,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:11:41,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:42,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:42,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:42,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-02-25 15:11:42,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:42,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:11:42,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:11:42,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:11:42,691 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-02-25 15:11:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:47,893 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-02-25 15:11:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:11:47,902 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-02-25 15:11:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:47,903 INFO L225 Difference]: With dead ends: 244 [2019-02-25 15:11:47,903 INFO L226 Difference]: Without dead ends: 182 [2019-02-25 15:11:47,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-02-25 15:11:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-25 15:11:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-02-25 15:11:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-25 15:11:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-02-25 15:11:47,925 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-02-25 15:11:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:47,925 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-02-25 15:11:47,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:11:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-02-25 15:11:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-25 15:11:47,926 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:47,926 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-25 15:11:47,926 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:47,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:47,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-02-25 15:11:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:47,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:47,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:47,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:47,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:48,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:48,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:48,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:48,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:48,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:48,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:48,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:48,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:48,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:11:48,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:49,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:49,491 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:49,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:49,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-02-25 15:11:49,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:49,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:11:49,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:11:49,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:11:49,512 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-02-25 15:11:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:50,433 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-02-25 15:11:50,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:11:50,433 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-02-25 15:11:50,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:50,434 INFO L225 Difference]: With dead ends: 255 [2019-02-25 15:11:50,434 INFO L226 Difference]: Without dead ends: 124 [2019-02-25 15:11:50,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:11:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-25 15:11:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-02-25 15:11:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-25 15:11:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-02-25 15:11:50,453 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-02-25 15:11:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:50,453 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-02-25 15:11:50,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:11:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-02-25 15:11:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-25 15:11:50,454 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:50,454 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-25 15:11:50,454 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:50,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:50,454 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-02-25 15:11:50,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:50,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:50,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:50,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:51,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:51,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:51,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:51,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:51,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:51,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:51,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:51,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:51,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-25 15:11:51,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:51,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:11:51,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:53,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:55,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:55,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-02-25 15:11:55,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:55,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-25 15:11:55,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-25 15:11:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:11:55,553 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-02-25 15:12:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:06,031 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-02-25 15:12:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-02-25 15:12:06,031 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-02-25 15:12:06,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:06,033 INFO L225 Difference]: With dead ends: 325 [2019-02-25 15:12:06,033 INFO L226 Difference]: Without dead ends: 190 [2019-02-25 15:12:06,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:12:06,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-25 15:12:06,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-02-25 15:12:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-25 15:12:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-02-25 15:12:06,054 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-02-25 15:12:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:06,055 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-02-25 15:12:06,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-25 15:12:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-02-25 15:12:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-25 15:12:06,055 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:06,056 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-02-25 15:12:06,056 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:06,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:06,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-02-25 15:12:06,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:06,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:06,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:06,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:07,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:07,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:07,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:07,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:07,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:07,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:07,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:07,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:07,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:07,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:07,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:07,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-25 15:12:07,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:08,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:08,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:08,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-02-25 15:12:08,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:08,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:12:08,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:12:08,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:12:08,517 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-02-25 15:12:12,813 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-25 15:12:13,019 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-25 15:12:14,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:14,191 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-02-25 15:12:14,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:12:14,191 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-02-25 15:12:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:14,192 INFO L225 Difference]: With dead ends: 274 [2019-02-25 15:12:14,192 INFO L226 Difference]: Without dead ends: 204 [2019-02-25 15:12:14,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:12:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-25 15:12:14,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-02-25 15:12:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-25 15:12:14,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-02-25 15:12:14,216 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-02-25 15:12:14,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:14,217 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-02-25 15:12:14,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:12:14,217 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-02-25 15:12:14,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-25 15:12:14,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:14,217 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-25 15:12:14,218 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:14,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:14,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-02-25 15:12:14,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:14,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:14,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:14,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:14,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:15,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:15,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:15,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:15,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:15,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:15,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:15,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:15,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:15,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:15,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:12:15,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:16,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:16,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:16,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:16,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-02-25 15:12:16,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:16,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:12:16,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:12:16,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:12:16,739 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-02-25 15:12:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:17,612 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-02-25 15:12:17,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:12:17,612 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-02-25 15:12:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:17,613 INFO L225 Difference]: With dead ends: 285 [2019-02-25 15:12:17,614 INFO L226 Difference]: Without dead ends: 138 [2019-02-25 15:12:17,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:12:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-25 15:12:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-02-25 15:12:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-25 15:12:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-02-25 15:12:17,641 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-02-25 15:12:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:17,641 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-02-25 15:12:17,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:12:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-02-25 15:12:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-25 15:12:17,642 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:17,642 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-25 15:12:17,643 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:17,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-02-25 15:12:17,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:17,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:17,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:18,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:18,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:18,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:18,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:18,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:18,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:18,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:18,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:19,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:12:19,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:19,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:12:19,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:21,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:23,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:23,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-02-25 15:12:23,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:23,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-25 15:12:23,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-25 15:12:23,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:12:23,924 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-02-25 15:12:34,810 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-25 15:12:35,112 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-25 15:12:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:37,713 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-02-25 15:12:37,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-02-25 15:12:37,713 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-02-25 15:12:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:37,715 INFO L225 Difference]: With dead ends: 363 [2019-02-25 15:12:37,715 INFO L226 Difference]: Without dead ends: 212 [2019-02-25 15:12:37,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-02-25 15:12:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-25 15:12:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-02-25 15:12:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-25 15:12:37,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-02-25 15:12:37,737 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-02-25 15:12:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:37,737 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-02-25 15:12:37,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-25 15:12:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-02-25 15:12:37,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-25 15:12:37,738 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:37,738 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-02-25 15:12:37,738 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:37,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:37,738 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-02-25 15:12:37,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:37,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:37,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:39,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:39,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:39,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:39,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:39,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:39,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:39,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:39,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:39,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:39,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:39,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:39,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-25 15:12:39,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:40,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:40,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:40,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:40,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-02-25 15:12:40,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:40,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:12:40,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:12:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:12:40,655 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-02-25 15:12:45,131 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-25 15:12:45,410 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-25 15:12:45,677 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-25 15:12:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:47,579 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-02-25 15:12:47,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:12:47,580 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-02-25 15:12:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:47,581 INFO L225 Difference]: With dead ends: 304 [2019-02-25 15:12:47,581 INFO L226 Difference]: Without dead ends: 226 [2019-02-25 15:12:47,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-02-25 15:12:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-25 15:12:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-02-25 15:12:47,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-25 15:12:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-02-25 15:12:47,607 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-02-25 15:12:47,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:47,607 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-02-25 15:12:47,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:12:47,607 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-02-25 15:12:47,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-25 15:12:47,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:47,608 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-25 15:12:47,608 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:47,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-02-25 15:12:47,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:47,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:47,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:47,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:47,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:48,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:48,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:48,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:48,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:48,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:48,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:48,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:48,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:48,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:12:48,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:49,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:50,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:50,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-02-25 15:12:50,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:50,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:12:50,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:12:50,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:12:50,003 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-02-25 15:12:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:51,378 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-02-25 15:12:51,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:12:51,379 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-02-25 15:12:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:51,380 INFO L225 Difference]: With dead ends: 315 [2019-02-25 15:12:51,380 INFO L226 Difference]: Without dead ends: 152 [2019-02-25 15:12:51,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:12:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-25 15:12:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-02-25 15:12:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-02-25 15:12:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-02-25 15:12:51,414 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-02-25 15:12:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:51,414 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-02-25 15:12:51,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:12:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-02-25 15:12:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-02-25 15:12:51,415 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:51,416 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-25 15:12:51,416 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:51,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:51,416 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-02-25 15:12:51,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:51,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:51,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:51,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:51,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:52,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:52,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:52,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:52,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:12:52,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:52,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:53,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:12:53,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:53,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:12:53,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:56,144 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:58,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:58,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-02-25 15:12:58,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:58,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-25 15:12:58,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-25 15:12:58,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:12:58,923 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-02-25 15:13:11,050 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-25 15:13:11,354 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-25 15:13:11,664 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-25 15:13:11,957 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:13:14,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:14,775 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-02-25 15:13:14,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-02-25 15:13:14,776 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-02-25 15:13:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:14,778 INFO L225 Difference]: With dead ends: 401 [2019-02-25 15:13:14,778 INFO L226 Difference]: Without dead ends: 234 [2019-02-25 15:13:14,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-02-25 15:13:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-25 15:13:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-02-25 15:13:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-25 15:13:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-02-25 15:13:14,814 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-02-25 15:13:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:14,815 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-02-25 15:13:14,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-25 15:13:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-02-25 15:13:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-25 15:13:14,816 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:14,816 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-02-25 15:13:14,816 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:14,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:14,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-02-25 15:13:14,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:14,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:14,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:14,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:14,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:17,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:17,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:17,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:17,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:17,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:17,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:17,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:17,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:17,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:17,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:17,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:13:17,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:19,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:19,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:19,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-02-25 15:13:19,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:19,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:13:19,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:13:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:13:19,904 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-02-25 15:13:25,863 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-25 15:13:26,215 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-25 15:13:26,524 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-25 15:13:26,738 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:13:26,929 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:13:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:28,967 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-02-25 15:13:28,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:13:28,968 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-02-25 15:13:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:28,969 INFO L225 Difference]: With dead ends: 334 [2019-02-25 15:13:28,969 INFO L226 Difference]: Without dead ends: 248 [2019-02-25 15:13:28,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-02-25 15:13:28,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-25 15:13:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-02-25 15:13:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-25 15:13:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-02-25 15:13:28,996 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-02-25 15:13:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:28,997 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-02-25 15:13:28,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:13:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-02-25 15:13:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-25 15:13:28,998 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:28,998 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-25 15:13:28,998 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-02-25 15:13:28,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:28,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:28,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:28,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:29,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:30,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:30,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:30,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:30,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:30,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:30,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:30,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:30,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:30,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:30,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:13:30,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:31,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:32,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:32,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-02-25 15:13:32,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:32,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:13:32,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:13:32,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:13:32,231 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-02-25 15:13:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:33,852 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-02-25 15:13:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:13:33,854 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-02-25 15:13:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:33,855 INFO L225 Difference]: With dead ends: 345 [2019-02-25 15:13:33,855 INFO L226 Difference]: Without dead ends: 166 [2019-02-25 15:13:33,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:13:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-25 15:13:33,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-02-25 15:13:33,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-25 15:13:33,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-02-25 15:13:33,882 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-02-25 15:13:33,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:33,882 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-02-25 15:13:33,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:13:33,882 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-02-25 15:13:33,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-02-25 15:13:33,883 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:33,883 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-25 15:13:33,883 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:33,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:33,883 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-02-25 15:13:33,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:33,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:33,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:33,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:33,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:35,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:35,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:35,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:35,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:35,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:35,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:35,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:35,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-25 15:13:35,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:35,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-25 15:13:35,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:37,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:37,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:37,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-02-25 15:13:37,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:37,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:13:37,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:13:37,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:13:37,431 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-02-25 15:13:44,555 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-25 15:13:44,903 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-25 15:13:45,309 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-25 15:13:45,521 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:13:45,743 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:13:45,945 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:13:46,139 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:13:48,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:48,059 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-02-25 15:13:48,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:13:48,059 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-02-25 15:13:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:48,060 INFO L225 Difference]: With dead ends: 349 [2019-02-25 15:13:48,061 INFO L226 Difference]: Without dead ends: 259 [2019-02-25 15:13:48,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:13:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-25 15:13:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-02-25 15:13:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-02-25 15:13:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-02-25 15:13:48,098 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-02-25 15:13:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:48,098 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-02-25 15:13:48,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:13:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-02-25 15:13:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-02-25 15:13:48,099 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:48,099 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-25 15:13:48,099 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:48,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:48,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-02-25 15:13:48,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:48,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:48,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:49,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:49,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:49,112 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:49,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:49,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:49,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:49,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:49,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:49,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:49,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:49,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:13:49,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:50,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:51,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:51,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-02-25 15:13:51,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:51,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:13:51,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:13:51,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:13:51,229 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-02-25 15:13:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:53,091 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-02-25 15:13:53,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:13:53,091 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-02-25 15:13:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:53,093 INFO L225 Difference]: With dead ends: 360 [2019-02-25 15:13:53,093 INFO L226 Difference]: Without dead ends: 173 [2019-02-25 15:13:53,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:13:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-25 15:13:53,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-02-25 15:13:53,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-25 15:13:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-02-25 15:13:53,123 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-02-25 15:13:53,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:53,123 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-02-25 15:13:53,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:13:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-02-25 15:13:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-25 15:13:53,124 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:53,124 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-25 15:13:53,124 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:53,124 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-02-25 15:13:53,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:53,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:53,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:53,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:53,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:54,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:54,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:54,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:54,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:54,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:54,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:13:54,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:54,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:54,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-25 15:13:54,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:56,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:56,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:56,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:56,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-02-25 15:13:56,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:56,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:13:56,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:13:56,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:13:56,864 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-02-25 15:14:04,489 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-25 15:14:04,845 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-25 15:14:05,190 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-25 15:14:05,465 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:14:05,759 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:14:05,976 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:14:06,180 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:14:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:08,345 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-02-25 15:14:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 15:14:08,345 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-02-25 15:14:08,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:08,346 INFO L225 Difference]: With dead ends: 364 [2019-02-25 15:14:08,347 INFO L226 Difference]: Without dead ends: 270 [2019-02-25 15:14:08,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:14:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-25 15:14:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-02-25 15:14:08,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-25 15:14:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-02-25 15:14:08,378 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-02-25 15:14:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:08,378 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-02-25 15:14:08,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:14:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-02-25 15:14:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-25 15:14:08,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:08,379 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-25 15:14:08,379 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:08,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-02-25 15:14:08,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:08,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:08,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:10,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:10,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:10,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:10,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:10,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:10,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:10,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:10,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:10,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:14:10,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:10,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:14:10,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:11,977 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:12,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:12,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-02-25 15:14:12,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:12,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:14:12,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:14:12,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:14:12,787 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-02-25 15:14:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:14,633 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-02-25 15:14:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:14:14,634 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-02-25 15:14:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:14,635 INFO L225 Difference]: With dead ends: 375 [2019-02-25 15:14:14,635 INFO L226 Difference]: Without dead ends: 180 [2019-02-25 15:14:14,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:14:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-25 15:14:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-02-25 15:14:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-25 15:14:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-02-25 15:14:14,675 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-02-25 15:14:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:14,676 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-02-25 15:14:14,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:14:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-02-25 15:14:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-25 15:14:14,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:14,677 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-25 15:14:14,677 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:14,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:14,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-02-25 15:14:14,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:14,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:14,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:14,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:14,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:16,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:16,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:16,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:16,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:16,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:16,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:16,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:16,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:16,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:16,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:16,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:16,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:14:16,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:18,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:18,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:18,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:18,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:18,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-02-25 15:14:18,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:18,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:14:18,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:14:18,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:14:18,435 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-02-25 15:14:25,008 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-25 15:14:25,384 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-25 15:14:25,747 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-25 15:14:26,061 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:14:26,323 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:14:26,558 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:14:26,778 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:14:26,991 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:14:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:29,182 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-02-25 15:14:29,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:14:29,182 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-02-25 15:14:29,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:29,185 INFO L225 Difference]: With dead ends: 379 [2019-02-25 15:14:29,185 INFO L226 Difference]: Without dead ends: 281 [2019-02-25 15:14:29,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:14:29,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-25 15:14:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-02-25 15:14:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-25 15:14:29,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-02-25 15:14:29,220 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-02-25 15:14:29,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:29,221 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-02-25 15:14:29,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:14:29,221 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-02-25 15:14:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-25 15:14:29,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:29,221 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-25 15:14:29,222 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:29,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-02-25 15:14:29,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:29,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:29,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:30,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:30,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:30,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:30,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:30,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:30,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:30,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:30,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:30,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:14:30,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:31,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:32,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:32,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:32,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-02-25 15:14:32,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:32,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:14:32,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:14:32,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:14:32,512 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-02-25 15:14:34,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:34,487 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-02-25 15:14:34,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:14:34,487 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-02-25 15:14:34,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:34,489 INFO L225 Difference]: With dead ends: 390 [2019-02-25 15:14:34,489 INFO L226 Difference]: Without dead ends: 187 [2019-02-25 15:14:34,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:14:34,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-25 15:14:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-02-25 15:14:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-25 15:14:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-02-25 15:14:34,540 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-02-25 15:14:34,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:34,540 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-02-25 15:14:34,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:14:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-02-25 15:14:34,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-25 15:14:34,541 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:34,541 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-25 15:14:34,542 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-02-25 15:14:34,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:34,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:34,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:36,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:36,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:36,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:36,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:36,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:36,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:14:36,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:36,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:36,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-25 15:14:36,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:36,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:14:36,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:41,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:45,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:45,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:45,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-02-25 15:14:45,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:45,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-25 15:14:45,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-25 15:14:45,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-02-25 15:14:45,408 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-02-25 15:15:03,332 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-25 15:15:03,813 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-25 15:15:04,284 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-25 15:15:04,669 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:15:05,033 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:15:05,384 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:15:05,737 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:15:06,054 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:15:06,368 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:15:07,090 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-25 15:15:09,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:09,635 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-02-25 15:15:09,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-02-25 15:15:09,635 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-02-25 15:15:09,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:09,637 INFO L225 Difference]: With dead ends: 496 [2019-02-25 15:15:09,637 INFO L226 Difference]: Without dead ends: 289 [2019-02-25 15:15:09,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-02-25 15:15:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-25 15:15:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-02-25 15:15:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-25 15:15:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-02-25 15:15:09,677 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-02-25 15:15:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:09,677 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-02-25 15:15:09,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-25 15:15:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-02-25 15:15:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-25 15:15:09,678 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:09,678 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-02-25 15:15:09,678 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-02-25 15:15:09,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:09,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:09,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:09,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:09,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:12,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:12,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:12,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:12,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:12,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:12,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:12,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:12,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:12,377 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:12,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:12,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-25 15:15:12,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:14,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:14,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:14,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:14,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-02-25 15:15:14,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:14,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:15:14,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:15:14,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:15:14,704 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-02-25 15:15:23,342 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-25 15:15:23,743 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-25 15:15:24,141 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-25 15:15:24,406 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:15:24,671 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:15:24,932 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:15:25,188 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:15:25,425 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:15:25,672 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:15:25,879 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:15:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:28,288 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-02-25 15:15:28,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-25 15:15:28,288 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-02-25 15:15:28,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:28,289 INFO L225 Difference]: With dead ends: 409 [2019-02-25 15:15:28,290 INFO L226 Difference]: Without dead ends: 303 [2019-02-25 15:15:28,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:15:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-02-25 15:15:28,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-02-25 15:15:28,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-25 15:15:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-02-25 15:15:28,330 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-02-25 15:15:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:28,330 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-02-25 15:15:28,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:15:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-02-25 15:15:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-25 15:15:28,331 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:28,331 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-25 15:15:28,331 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:28,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:28,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-02-25 15:15:28,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:28,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:28,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:28,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:29,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:29,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:29,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:29,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:29,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:29,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:29,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:29,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:29,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:15:29,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:33,116 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:34,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:34,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:34,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-02-25 15:15:34,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:34,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:15:34,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:15:34,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:15:34,139 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-02-25 15:15:36,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:36,438 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-02-25 15:15:36,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:15:36,439 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-02-25 15:15:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:36,440 INFO L225 Difference]: With dead ends: 420 [2019-02-25 15:15:36,440 INFO L226 Difference]: Without dead ends: 201 [2019-02-25 15:15:36,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:15:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-25 15:15:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-02-25 15:15:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-25 15:15:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-02-25 15:15:36,484 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-02-25 15:15:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:36,484 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-02-25 15:15:36,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:15:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-02-25 15:15:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-25 15:15:36,484 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:36,485 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-25 15:15:36,485 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:36,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-02-25 15:15:36,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:36,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:36,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:36,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:36,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:38,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:38,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:38,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:38,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:38,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:38,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:38,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:38,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:38,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-25 15:15:38,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:38,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-25 15:15:38,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:40,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:40,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:40,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-02-25 15:15:40,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:40,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:15:40,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:15:40,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:15:40,883 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-02-25 15:15:49,369 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-25 15:15:49,793 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-25 15:15:50,201 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-25 15:15:50,480 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:15:50,753 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:15:51,022 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:15:51,283 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:15:51,531 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:15:51,774 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:15:52,009 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:15:52,228 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:15:53,093 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-25 15:15:54,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:54,703 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-02-25 15:15:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-02-25 15:15:54,704 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-02-25 15:15:54,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:54,707 INFO L225 Difference]: With dead ends: 424 [2019-02-25 15:15:54,707 INFO L226 Difference]: Without dead ends: 314 [2019-02-25 15:15:54,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-02-25 15:15:54,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-25 15:15:54,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-02-25 15:15:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-25 15:15:54,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-02-25 15:15:54,755 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-02-25 15:15:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:54,756 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-02-25 15:15:54,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:15:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-02-25 15:15:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-25 15:15:54,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:54,757 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-25 15:15:54,757 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:54,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:54,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-02-25 15:15:54,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:54,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:54,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:54,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:55,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:55,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:55,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:55,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:55,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:55,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:15:55,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:55,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:55,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:55,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:55,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-25 15:15:55,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:57,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:58,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:58,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:58,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-02-25 15:15:58,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:58,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:15:58,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:15:58,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:15:58,713 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-02-25 15:16:01,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:01,159 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-02-25 15:16:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:16:01,159 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-02-25 15:16:01,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:01,161 INFO L225 Difference]: With dead ends: 435 [2019-02-25 15:16:01,161 INFO L226 Difference]: Without dead ends: 208 [2019-02-25 15:16:01,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:16:01,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-25 15:16:01,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-02-25 15:16:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-25 15:16:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-02-25 15:16:01,211 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-02-25 15:16:01,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:01,211 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-02-25 15:16:01,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:16:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-02-25 15:16:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-25 15:16:01,212 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:01,212 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-25 15:16:01,212 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:01,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:01,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-02-25 15:16:01,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:01,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:01,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:01,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:01,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:03,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:03,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:03,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:03,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:03,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:03,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:03,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:03,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:16:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:03,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-25 15:16:03,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:05,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:06,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:06,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-02-25 15:16:06,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:06,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:16:06,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:16:06,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:16:06,008 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-02-25 15:16:14,980 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-25 15:16:15,412 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-25 15:16:15,834 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-25 15:16:16,134 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:16:16,424 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:16:16,743 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:16:17,024 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:16:17,283 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:16:17,531 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:16:17,768 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:16:17,999 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:16:18,237 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:16:18,455 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-25 15:16:18,736 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-25 15:16:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:20,853 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-02-25 15:16:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-02-25 15:16:20,853 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-02-25 15:16:20,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:20,855 INFO L225 Difference]: With dead ends: 439 [2019-02-25 15:16:20,855 INFO L226 Difference]: Without dead ends: 325 [2019-02-25 15:16:20,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:16:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-25 15:16:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-02-25 15:16:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-25 15:16:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-02-25 15:16:20,917 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-02-25 15:16:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:20,917 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-02-25 15:16:20,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:16:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-02-25 15:16:20,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-02-25 15:16:20,919 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:20,919 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-25 15:16:20,919 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:20,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:20,920 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-02-25 15:16:20,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:20,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:20,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:22,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:22,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:22,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:22,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:22,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:22,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:22,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:22,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:16:22,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:16:22,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-25 15:16:22,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:22,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-25 15:16:22,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:24,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:25,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:25,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-02-25 15:16:25,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:25,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:16:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:16:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:16:25,910 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-02-25 15:16:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:28,626 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-02-25 15:16:28,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:16:28,627 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-02-25 15:16:28,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:28,628 INFO L225 Difference]: With dead ends: 450 [2019-02-25 15:16:28,629 INFO L226 Difference]: Without dead ends: 215 [2019-02-25 15:16:28,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:16:28,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-25 15:16:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-02-25 15:16:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-25 15:16:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-02-25 15:16:28,679 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-02-25 15:16:28,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:28,679 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-02-25 15:16:28,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:16:28,679 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-02-25 15:16:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-25 15:16:28,680 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:28,680 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-25 15:16:28,681 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:28,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:28,681 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-02-25 15:16:28,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:28,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:28,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:28,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:31,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:31,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:31,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:31,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:31,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:31,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:31,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:31,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:31,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:31,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:31,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 123 conjunts are in the unsatisfiable core [2019-02-25 15:16:31,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:33,875 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:34,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:34,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-02-25 15:16:34,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:34,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:16:34,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:16:34,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:16:34,339 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-02-25 15:16:44,553 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-25 15:16:45,007 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-25 15:16:45,453 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-25 15:16:45,773 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:16:46,075 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:16:46,369 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:16:46,658 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:16:46,942 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:16:47,214 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:16:47,474 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:16:47,722 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:16:47,994 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:16:48,230 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:16:50,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:50,819 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-02-25 15:16:50,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-02-25 15:16:50,820 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-02-25 15:16:50,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:50,822 INFO L225 Difference]: With dead ends: 454 [2019-02-25 15:16:50,822 INFO L226 Difference]: Without dead ends: 336 [2019-02-25 15:16:50,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:16:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-02-25 15:16:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-02-25 15:16:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-25 15:16:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-02-25 15:16:50,882 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-02-25 15:16:50,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:50,882 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-02-25 15:16:50,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:16:50,882 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-02-25 15:16:50,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-25 15:16:50,883 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:50,883 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-25 15:16:50,883 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:50,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-02-25 15:16:50,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:50,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:50,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:50,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:52,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:52,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:52,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:52,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:52,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:52,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:16:52,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:52,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:16:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:52,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:16:52,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:53,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:55,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:55,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-02-25 15:16:55,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:55,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:16:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:16:55,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:16:55,190 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-02-25 15:16:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:57,932 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-02-25 15:16:57,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:16:57,932 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-02-25 15:16:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:57,934 INFO L225 Difference]: With dead ends: 465 [2019-02-25 15:16:57,934 INFO L226 Difference]: Without dead ends: 222 [2019-02-25 15:16:57,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:16:57,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-25 15:16:57,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-02-25 15:16:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-25 15:16:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-02-25 15:16:57,981 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-02-25 15:16:57,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:57,981 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-02-25 15:16:57,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:16:57,981 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-02-25 15:16:57,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-25 15:16:57,982 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:57,982 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-25 15:16:57,982 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-02-25 15:16:57,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:57,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:57,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:57,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:57,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:00,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:00,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:00,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:00,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:00,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:00,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:00,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:17:00,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:17:00,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-25 15:17:00,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:00,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:17:00,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:06,443 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:12,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:12,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-02-25 15:17:12,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:12,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-25 15:17:12,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-25 15:17:12,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:17:12,088 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-02-25 15:17:36,720 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-25 15:17:37,286 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-25 15:17:37,883 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-25 15:17:38,365 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:17:38,844 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:17:39,353 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:17:39,804 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:17:40,244 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:17:40,751 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:17:41,171 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:17:41,569 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:17:41,943 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:17:42,309 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:17:42,649 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:17:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:46,319 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-02-25 15:17:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-02-25 15:17:46,320 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-02-25 15:17:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:46,322 INFO L225 Difference]: With dead ends: 591 [2019-02-25 15:17:46,322 INFO L226 Difference]: Without dead ends: 344 [2019-02-25 15:17:46,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-02-25 15:17:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-25 15:17:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-02-25 15:17:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-25 15:17:46,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-02-25 15:17:46,372 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-02-25 15:17:46,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:46,372 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-02-25 15:17:46,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-25 15:17:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-02-25 15:17:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-25 15:17:46,373 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:46,373 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-02-25 15:17:46,373 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:46,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:46,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-02-25 15:17:46,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:46,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:46,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:46,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:46,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:48,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:48,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:48,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:48,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:48,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:48,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:17:48,713 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:17:48,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:17:48,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:17:48,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:48,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 131 conjunts are in the unsatisfiable core [2019-02-25 15:17:48,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:51,677 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:51,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:51,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-02-25 15:17:51,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:51,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-25 15:17:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-25 15:17:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:17:51,914 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-02-25 15:18:04,768 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-25 15:18:05,271 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-25 15:18:05,775 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-25 15:18:06,195 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:18:06,553 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:18:06,881 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:18:07,203 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:18:07,517 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:18:07,837 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:18:08,135 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:18:08,419 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:18:08,690 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:18:08,992 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:18:09,241 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:18:09,491 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:18:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:12,220 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-02-25 15:18:12,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-02-25 15:18:12,221 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-02-25 15:18:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:12,223 INFO L225 Difference]: With dead ends: 484 [2019-02-25 15:18:12,223 INFO L226 Difference]: Without dead ends: 358 [2019-02-25 15:18:12,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:18:12,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-25 15:18:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-02-25 15:18:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-25 15:18:12,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-02-25 15:18:12,275 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-02-25 15:18:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:12,276 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-02-25 15:18:12,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-25 15:18:12,276 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-02-25 15:18:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-25 15:18:12,277 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:12,277 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-25 15:18:12,277 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-02-25 15:18:12,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:12,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:12,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:13,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:13,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:13,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:13,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:13,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:13,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:13,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:13,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:13,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:18:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:13,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:18:13,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:15,533 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:17,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:17,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-02-25 15:18:17,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:17,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-25 15:18:17,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-25 15:18:17,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:18:17,410 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-02-25 15:18:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:19,709 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-02-25 15:18:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:18:19,710 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-02-25 15:18:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:19,711 INFO L225 Difference]: With dead ends: 495 [2019-02-25 15:18:19,711 INFO L226 Difference]: Without dead ends: 236 [2019-02-25 15:18:19,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:18:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-25 15:18:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-02-25 15:18:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-25 15:18:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-02-25 15:18:19,764 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-02-25 15:18:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:19,764 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-02-25 15:18:19,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-25 15:18:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-02-25 15:18:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-02-25 15:18:19,765 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:19,765 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-25 15:18:19,765 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-02-25 15:18:19,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:19,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:19,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:19,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:19,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:22,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:22,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:22,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:22,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:22,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:22,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:22,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:18:22,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:18:22,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-25 15:18:22,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:22,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:18:22,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:29,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:35,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:35,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-02-25 15:18:35,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:35,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-25 15:18:35,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-25 15:18:35,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:18:35,700 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-02-25 15:19:01,044 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-25 15:19:01,659 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-25 15:19:02,272 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-25 15:19:02,852 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:19:03,390 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:19:03,917 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:19:04,415 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:19:04,917 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:19:05,413 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:19:05,866 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:19:06,328 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:19:06,758 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:19:07,181 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:19:07,679 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:19:08,072 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:19:08,429 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:19:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:12,161 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-02-25 15:19:12,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-02-25 15:19:12,161 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-02-25 15:19:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:12,163 INFO L225 Difference]: With dead ends: 629 [2019-02-25 15:19:12,164 INFO L226 Difference]: Without dead ends: 366 [2019-02-25 15:19:12,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.6s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-02-25 15:19:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-25 15:19:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-02-25 15:19:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-25 15:19:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-02-25 15:19:12,220 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-02-25 15:19:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:12,220 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-02-25 15:19:12,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-25 15:19:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-02-25 15:19:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-25 15:19:12,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:12,221 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-02-25 15:19:12,221 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:12,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-02-25 15:19:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:12,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:12,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:15,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:15,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:15,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:15,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:15,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:19:15,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:19:15,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:19:15,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:15,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-25 15:19:15,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:18,046 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:18,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:18,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:18,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-02-25 15:19:18,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:18,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-25 15:19:18,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-25 15:19:18,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:19:18,310 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-02-25 15:19:30,159 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-25 15:19:30,714 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-25 15:19:31,245 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-25 15:19:31,623 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:19:31,989 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:19:32,345 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:19:32,714 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:19:33,065 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:19:33,462 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:19:33,788 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:19:34,103 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:19:34,401 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:19:34,697 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:19:34,982 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:19:35,273 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:19:35,536 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:19:35,794 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:19:38,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:38,849 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-02-25 15:19:38,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-02-25 15:19:38,849 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-02-25 15:19:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:38,851 INFO L225 Difference]: With dead ends: 514 [2019-02-25 15:19:38,851 INFO L226 Difference]: Without dead ends: 380 [2019-02-25 15:19:38,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:19:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-25 15:19:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-02-25 15:19:38,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-25 15:19:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-02-25 15:19:38,911 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-02-25 15:19:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:38,911 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-02-25 15:19:38,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-25 15:19:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-02-25 15:19:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-25 15:19:38,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:38,912 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-25 15:19:38,912 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:38,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-02-25 15:19:38,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:38,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:38,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:38,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:40,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:40,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:40,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:40,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:40,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:40,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:40,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:40,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:19:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:40,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:19:40,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:42,452 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:44,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:44,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-02-25 15:19:44,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:44,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-25 15:19:44,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-25 15:19:44,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:19:44,188 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-02-25 15:19:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:46,728 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-02-25 15:19:46,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:19:46,729 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-02-25 15:19:46,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:46,731 INFO L225 Difference]: With dead ends: 525 [2019-02-25 15:19:46,731 INFO L226 Difference]: Without dead ends: 250 [2019-02-25 15:19:46,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:19:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-25 15:19:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-02-25 15:19:46,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-25 15:19:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-02-25 15:19:46,798 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-02-25 15:19:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:46,798 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-02-25 15:19:46,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-25 15:19:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-02-25 15:19:46,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-02-25 15:19:46,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:46,800 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-25 15:19:46,800 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:46,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-02-25 15:19:46,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:46,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:46,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:46,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:49,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:49,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:49,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:49,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:49,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:49,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:49,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:19:49,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:19:49,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-25 15:19:49,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:49,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:19:49,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:57,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:04,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:04,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-02-25 15:20:04,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:04,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-02-25 15:20:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-02-25 15:20:04,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:20:04,619 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-02-25 15:20:32,641 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-25 15:20:33,289 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-25 15:20:33,952 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-25 15:20:34,610 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-25 15:20:35,242 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:20:35,818 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:20:36,387 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:20:36,939 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:20:37,493 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:20:38,031 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:20:38,541 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:20:39,013 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:20:39,492 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:20:40,027 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:20:40,474 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:20:40,899 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:20:41,301 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:20:41,685 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:20:45,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:45,799 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-02-25 15:20:45,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-02-25 15:20:45,799 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-02-25 15:20:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:45,800 INFO L225 Difference]: With dead ends: 667 [2019-02-25 15:20:45,800 INFO L226 Difference]: Without dead ends: 388 [2019-02-25 15:20:45,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-02-25 15:20:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-02-25 15:20:45,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-02-25 15:20:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-02-25 15:20:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-02-25 15:20:45,902 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-02-25 15:20:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:45,903 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-02-25 15:20:45,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-02-25 15:20:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-02-25 15:20:45,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-02-25 15:20:45,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:45,904 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-02-25 15:20:45,904 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:45,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:45,904 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-02-25 15:20:45,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:45,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:45,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:45,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:48,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:48,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:48,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:48,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:48,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:48,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:48,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:48,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:20:48,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:20:48,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:20:48,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:48,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 147 conjunts are in the unsatisfiable core [2019-02-25 15:20:48,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:52,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:52,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:52,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-02-25 15:20:52,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:52,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-25 15:20:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-25 15:20:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:20:52,425 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-02-25 15:21:06,757 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-25 15:21:07,351 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-25 15:21:07,935 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-25 15:21:08,343 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-25 15:21:08,761 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-25 15:21:09,165 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:21:09,554 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:21:09,932 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:21:10,327 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:21:10,761 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:21:11,107 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:21:11,449 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:21:11,785 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:21:12,114 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:21:12,435 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:21:12,735 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:21:13,022 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:21:13,299 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:21:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:16,650 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-02-25 15:21:16,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-02-25 15:21:16,650 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-02-25 15:21:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:16,652 INFO L225 Difference]: With dead ends: 544 [2019-02-25 15:21:16,653 INFO L226 Difference]: Without dead ends: 402 [2019-02-25 15:21:16,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:21:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-25 15:21:16,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-02-25 15:21:16,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-25 15:21:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-02-25 15:21:16,719 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-02-25 15:21:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:16,719 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-02-25 15:21:16,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-25 15:21:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-02-25 15:21:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-25 15:21:16,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:16,721 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-25 15:21:16,721 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-02-25 15:21:16,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:16,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:16,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:16,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:16,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:18,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:18,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:18,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:18,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:18,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:18,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:18,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:18,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:18,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:18,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:21:18,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:20,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:22,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:22,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-02-25 15:21:22,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:22,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-25 15:21:22,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-25 15:21:22,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:21:22,571 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-02-25 15:21:25,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:25,473 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-02-25 15:21:25,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:21:25,473 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-02-25 15:21:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:25,475 INFO L225 Difference]: With dead ends: 555 [2019-02-25 15:21:25,475 INFO L226 Difference]: Without dead ends: 264 [2019-02-25 15:21:25,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:21:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-25 15:21:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-02-25 15:21:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-25 15:21:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-02-25 15:21:25,541 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-02-25 15:21:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:25,541 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-02-25 15:21:25,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-25 15:21:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-02-25 15:21:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-25 15:21:25,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:25,542 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-25 15:21:25,543 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-02-25 15:21:25,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:25,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:25,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:25,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:25,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:28,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:28,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:28,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:28,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:28,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:28,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:28,852 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:21:28,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:21:28,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-25 15:21:28,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:28,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-25 15:21:28,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:37,396 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:45,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:45,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-02-25 15:21:45,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:45,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-25 15:21:45,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-25 15:21:45,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:21:45,246 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-02-25 15:22:16,707 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-25 15:22:17,514 WARN L181 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-25 15:22:18,280 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-25 15:22:18,960 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-25 15:22:19,624 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-25 15:22:20,289 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-25 15:22:20,924 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:22:21,534 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:22:22,201 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:22:22,814 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:22:23,418 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:22:23,955 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:22:24,487 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:22:25,012 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:22:25,523 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:22:26,011 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:22:26,486 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:22:26,934 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:22:27,444 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:22:27,865 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:22:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:32,063 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-02-25 15:22:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-02-25 15:22:32,063 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-02-25 15:22:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:32,066 INFO L225 Difference]: With dead ends: 705 [2019-02-25 15:22:32,066 INFO L226 Difference]: Without dead ends: 410 [2019-02-25 15:22:32,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-02-25 15:22:32,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-25 15:22:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-02-25 15:22:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-25 15:22:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-02-25 15:22:32,140 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-02-25 15:22:32,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:32,140 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-02-25 15:22:32,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-25 15:22:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-02-25 15:22:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-25 15:22:32,142 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:32,142 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-02-25 15:22:32,142 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:32,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:32,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-02-25 15:22:32,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:32,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:32,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:32,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:32,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:35,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:35,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:35,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:35,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:35,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:35,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:35,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:22:35,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:22:35,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:22:35,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:35,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 155 conjunts are in the unsatisfiable core [2019-02-25 15:22:35,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:39,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:39,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:39,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-02-25 15:22:39,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:39,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-25 15:22:39,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-25 15:22:39,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:22:39,815 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-02-25 15:22:56,456 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-25 15:22:57,111 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-25 15:22:57,750 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-25 15:22:58,269 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-02-25 15:22:58,738 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-25 15:22:59,177 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-25 15:22:59,601 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-25 15:23:00,032 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-25 15:23:00,441 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-25 15:23:00,839 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-25 15:23:01,243 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-25 15:23:01,618 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-25 15:23:01,991 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-25 15:23:02,374 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-25 15:23:02,749 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-25 15:23:03,135 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-25 15:23:03,484 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-25 15:23:03,805 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-25 15:23:04,112 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-25 15:23:04,404 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-25 15:23:04,689 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-25 15:23:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:07,816 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-02-25 15:23:07,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-02-25 15:23:07,816 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-02-25 15:23:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:07,818 INFO L225 Difference]: With dead ends: 574 [2019-02-25 15:23:07,818 INFO L226 Difference]: Without dead ends: 424 [2019-02-25 15:23:07,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:23:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-25 15:23:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-02-25 15:23:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-25 15:23:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-02-25 15:23:07,902 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-02-25 15:23:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:07,902 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-02-25 15:23:07,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-25 15:23:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-02-25 15:23:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-25 15:23:07,903 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:07,903 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-25 15:23:07,904 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:07,904 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-02-25 15:23:07,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:07,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:07,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:23:07,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:07,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:10,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:10,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:10,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:23:10,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:23:10,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:10,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:10,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:10,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:10,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-25 15:23:10,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:12,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:12,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:14,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:14,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-02-25 15:23:14,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:14,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-25 15:23:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-25 15:23:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:23:14,608 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-02-25 15:23:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:17,866 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-02-25 15:23:17,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:23:17,866 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-02-25 15:23:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:17,868 INFO L225 Difference]: With dead ends: 585 [2019-02-25 15:23:17,868 INFO L226 Difference]: Without dead ends: 278 [2019-02-25 15:23:17,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:23:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-25 15:23:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-02-25 15:23:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-25 15:23:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-02-25 15:23:17,950 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-02-25 15:23:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:17,950 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-02-25 15:23:17,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-25 15:23:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-02-25 15:23:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-25 15:23:17,951 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:17,951 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-25 15:23:17,951 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:17,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-02-25 15:23:17,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:17,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:17,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:17,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:17,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:21,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:21,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:21,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:23:21,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:23:21,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:21,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:21,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:23:21,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:23:21,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-25 15:23:21,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:23:21,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-25 15:23:21,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:30,856 INFO L322 TraceCheckSpWp]: Computing backward predicates...