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-1de736e-m [2019-02-15 10:44:58,858 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:44:58,860 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:44:58,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:44:58,872 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:44:58,873 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:44:58,874 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:44:58,876 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:44:58,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:44:58,882 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:44:58,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:44:58,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:44:58,885 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:44:58,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:44:58,887 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:44:58,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:44:58,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:44:58,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:44:58,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:44:58,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:44:58,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:44:58,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:44:58,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:44:58,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:44:58,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:44:58,910 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:44:58,911 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:44:58,912 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:44:58,913 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:44:58,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:44:58,917 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:44:58,918 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:44:58,918 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:44:58,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:44:58,920 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:44:58,920 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:44:58,921 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-15 10:44:58,938 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:44:58,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:44:58,940 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:44:58,941 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:44:58,941 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:44:58,941 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:44:58,941 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:44:58,942 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:44:58,942 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:44:58,942 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:44:58,942 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:44:58,942 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:44:58,943 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:44:58,943 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:44:58,943 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:44:58,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:44:58,945 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:44:58,945 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:44:58,945 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:44:58,946 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:44:58,946 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:44:58,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:44:58,946 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:44:58,946 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:44:58,946 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:44:58,947 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:44:58,947 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:44:58,947 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:44:58,947 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:44:58,947 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:44:58,948 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:44:58,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:44:58,948 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:44:58,948 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:44:58,949 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:44:58,949 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:44:58,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:44:58,949 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:44:58,949 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:44:58,950 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:44:58,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:44:59,005 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:44:59,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:44:59,013 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:44:59,013 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:44:59,014 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-15 10:44:59,014 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-02-15 10:44:59,055 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:44:59,057 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:44:59,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:59,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:44:59,058 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:44:59,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,086 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,095 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:44:59,096 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:44:59,096 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:44:59,097 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:44:59,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,111 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/1) ... [2019-02-15 10:44:59,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:44:59,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:44:59,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:44:59,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:44:59,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (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-15 10:44:59,189 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-02-15 10:44:59,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:44:59,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:44:59,381 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:44:59,382 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-15 10:44:59,383 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:59 BoogieIcfgContainer [2019-02-15 10:44:59,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:44:59,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:44:59,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:44:59,387 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:44:59,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:44:59" (1/2) ... [2019-02-15 10:44:59,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af4a57 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:44:59, skipping insertion in model container [2019-02-15 10:44:59,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:44:59" (2/2) ... [2019-02-15 10:44:59,390 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-02-15 10:44:59,400 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:44:59,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 10:44:59,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 10:44:59,450 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:44:59,450 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:44:59,450 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:44:59,450 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:44:59,451 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:44:59,451 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:44:59,451 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:44:59,451 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:44:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-02-15 10:44:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:44:59,470 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:59,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:44:59,473 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-02-15 10:44:59,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:59,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:59,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:44:59,720 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-15 10:44:59,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:44:59,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 10:44:59,724 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:44:59,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:44:59,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:44:59,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:44:59,748 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-02-15 10:44:59,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:44:59,921 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-02-15 10:44:59,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:44:59,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-15 10:44:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:44:59,934 INFO L225 Difference]: With dead ends: 26 [2019-02-15 10:44:59,934 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 10:44:59,938 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-15 10:44:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 10:44:59,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-15 10:44:59,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-15 10:44:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-02-15 10:44:59,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-02-15 10:44:59,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:44:59,968 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-02-15 10:44:59,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:44:59,968 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-02-15 10:44:59,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:44:59,969 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:44:59,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:44:59,969 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:44:59,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:44:59,970 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-02-15 10:44:59,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:44:59,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:44:59,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:44:59,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:44:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:00,074 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-15 10:45:00,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:45:00,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-15 10:45:00,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:45:00,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:45:00,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:45:00,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:45:00,078 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-02-15 10:45:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:00,189 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-02-15 10:45:00,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:45:00,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-15 10:45:00,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:00,191 INFO L225 Difference]: With dead ends: 25 [2019-02-15 10:45:00,191 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 10:45:00,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 10:45:00,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 10:45:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-02-15 10:45:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 10:45:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-02-15 10:45:00,199 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-02-15 10:45:00,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:00,200 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-02-15 10:45:00,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:45:00,200 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-02-15 10:45:00,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:45:00,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:00,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:45:00,201 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-02-15 10:45:00,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:00,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:00,273 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-15 10:45:00,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:45:00,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 10:45:00,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:45:00,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:45:00,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:45:00,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:45:00,275 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-02-15 10:45:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:00,304 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-02-15 10:45:00,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:45:00,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-15 10:45:00,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:00,305 INFO L225 Difference]: With dead ends: 24 [2019-02-15 10:45:00,305 INFO L226 Difference]: Without dead ends: 13 [2019-02-15 10:45:00,305 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-15 10:45:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-15 10:45:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-15 10:45:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-15 10:45:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-15 10:45:00,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-02-15 10:45:00,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:00,310 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-15 10:45:00,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:45:00,310 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-15 10:45:00,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:45:00,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:00,310 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:45:00,311 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:00,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-02-15 10:45:00,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:00,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:00,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:00,574 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-15 10:45:00,756 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-15 10:45:00,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:00,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:00,758 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-15 10:45:00,760 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-02-15 10:45:00,805 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:45:00,805 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:45:00,937 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:45:00,939 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-15 10:45:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:00,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:45:00,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:00,946 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-15 10:45:00,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:00,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:00,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:01,071 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-15 10:45:01,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:01,167 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-15 10:45:01,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:01,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-02-15 10:45:01,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:01,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:45:01,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:45:01,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:45:01,188 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-15 10:45:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:01,441 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-02-15 10:45:01,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:45:01,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-02-15 10:45:01,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:01,446 INFO L225 Difference]: With dead ends: 26 [2019-02-15 10:45:01,446 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 10:45:01,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:45:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 10:45:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-15 10:45:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 10:45:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-02-15 10:45:01,450 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-02-15 10:45:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:01,451 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-02-15 10:45:01,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:45:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-02-15 10:45:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-15 10:45:01,451 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:01,452 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:45:01,452 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:01,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:01,452 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-02-15 10:45:01,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:01,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:01,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:01,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:01,549 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-15 10:45:01,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:01,550 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-02-15 10:45:01,551 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-02-15 10:45:01,554 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:45:01,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:45:01,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:45:01,613 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-15 10:45:01,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:01,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:45:01,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:01,613 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-15 10:45:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:01,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:01,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:01,888 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-15 10:45:01,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:01,903 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-15 10:45:01,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:01,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-02-15 10:45:01,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:01,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:45:01,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:45:01,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:45:01,924 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-02-15 10:45:02,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:02,313 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-02-15 10:45:02,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:45:02,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-02-15 10:45:02,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:02,315 INFO L225 Difference]: With dead ends: 31 [2019-02-15 10:45:02,315 INFO L226 Difference]: Without dead ends: 19 [2019-02-15 10:45:02,315 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-15 10:45:02,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-15 10:45:02,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-02-15 10:45:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 10:45:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-02-15 10:45:02,319 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-02-15 10:45:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:02,319 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-02-15 10:45:02,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:45:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-02-15 10:45:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-15 10:45:02,320 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:02,320 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-15 10:45:02,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:02,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:02,321 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-02-15 10:45:02,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:02,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:02,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:02,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:02,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:02,653 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-15 10:45:02,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:02,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:02,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:02,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:02,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:02,654 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-15 10:45:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:02,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:02,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:45:02,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:02,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:02,797 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-15 10:45:02,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:02,830 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-15 10:45:02,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:02,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-02-15 10:45:02,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:02,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:45:02,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:45:02,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:45:02,852 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-02-15 10:45:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:03,169 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-02-15 10:45:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:45:03,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-02-15 10:45:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:03,170 INFO L225 Difference]: With dead ends: 35 [2019-02-15 10:45:03,170 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 10:45:03,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:45:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 10:45:03,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-02-15 10:45:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 10:45:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-02-15 10:45:03,176 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-02-15 10:45:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:03,177 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-02-15 10:45:03,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:45:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-02-15 10:45:03,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-15 10:45:03,178 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:03,178 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-15 10:45:03,178 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:03,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:03,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-02-15 10:45:03,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:03,311 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-15 10:45:03,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:03,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:03,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:03,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:03,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:03,312 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-15 10:45:03,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:03,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:03,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:03,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:03,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:03,370 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-15 10:45:03,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:03,417 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-15 10:45:03,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:03,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-02-15 10:45:03,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:03,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:45:03,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:45:03,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:45:03,438 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-02-15 10:45:03,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:03,535 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-02-15 10:45:03,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:45:03,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-15 10:45:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:03,536 INFO L225 Difference]: With dead ends: 45 [2019-02-15 10:45:03,536 INFO L226 Difference]: Without dead ends: 26 [2019-02-15 10:45:03,537 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-15 10:45:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-15 10:45:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-02-15 10:45:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-15 10:45:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-02-15 10:45:03,541 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-02-15 10:45:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:03,542 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-02-15 10:45:03,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:45:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-02-15 10:45:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-15 10:45:03,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:03,543 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-15 10:45:03,543 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-02-15 10:45:03,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:03,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:03,843 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-15 10:45:03,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:03,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:03,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:03,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:03,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:03,845 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-15 10:45:03,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:03,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:03,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:03,961 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-15 10:45:03,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:03,995 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-15 10:45:04,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:04,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-02-15 10:45:04,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:04,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:45:04,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:45:04,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:45:04,015 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-02-15 10:45:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:04,414 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-02-15 10:45:04,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 10:45:04,490 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-02-15 10:45:04,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:04,491 INFO L225 Difference]: With dead ends: 49 [2019-02-15 10:45:04,491 INFO L226 Difference]: Without dead ends: 39 [2019-02-15 10:45:04,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:45:04,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-15 10:45:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-02-15 10:45:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 10:45:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-02-15 10:45:04,499 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-02-15 10:45:04,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:04,499 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-02-15 10:45:04,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:45:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-02-15 10:45:04,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-15 10:45:04,500 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,500 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-15 10:45:04,500 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-02-15 10:45:04,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:04,614 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-15 10:45:04,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:04,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:04,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:04,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:04,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:04,615 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-15 10:45:04,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:04,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:04,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 10:45:04,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:04,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:04,704 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-15 10:45:04,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:04,774 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-15 10:45:04,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:04,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-02-15 10:45:04,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:04,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:45:04,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:45:04,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:45:04,807 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-02-15 10:45:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:05,319 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-02-15 10:45:05,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:45:05,320 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-02-15 10:45:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:05,320 INFO L225 Difference]: With dead ends: 60 [2019-02-15 10:45:05,320 INFO L226 Difference]: Without dead ends: 33 [2019-02-15 10:45:05,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:45:05,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-15 10:45:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-02-15 10:45:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:45:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-02-15 10:45:05,327 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-02-15 10:45:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:05,327 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-02-15 10:45:05,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:45:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-02-15 10:45:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-15 10:45:05,328 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:05,328 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-15 10:45:05,329 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:05,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:05,329 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-02-15 10:45:05,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:05,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:05,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,541 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-15 10:45:05,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:05,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:05,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:05,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,542 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-15 10:45:05,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:05,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:05,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:05,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:05,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:05,683 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-15 10:45:05,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:05,724 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-15 10:45:05,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:05,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-02-15 10:45:05,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:05,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 10:45:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 10:45:05,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:45:05,744 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-02-15 10:45:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:06,214 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-02-15 10:45:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 10:45:06,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-02-15 10:45:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:06,219 INFO L225 Difference]: With dead ends: 64 [2019-02-15 10:45:06,219 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 10:45:06,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-02-15 10:45:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 10:45:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-15 10:45:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-15 10:45:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-02-15 10:45:06,226 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-02-15 10:45:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:06,227 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-02-15 10:45:06,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 10:45:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-02-15 10:45:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-15 10:45:06,228 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:06,228 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-15 10:45:06,228 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-02-15 10:45:06,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:06,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:06,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:06,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:06,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:06,407 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-15 10:45:06,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:06,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:06,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:06,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,408 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-15 10:45:06,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:06,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:06,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:06,892 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-15 10:45:06,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:06,943 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-15 10:45:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:06,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-02-15 10:45:06,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:06,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-15 10:45:06,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-15 10:45:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:45:06,964 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-02-15 10:45:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:07,260 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-02-15 10:45:07,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:45:07,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-02-15 10:45:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:07,261 INFO L225 Difference]: With dead ends: 75 [2019-02-15 10:45:07,261 INFO L226 Difference]: Without dead ends: 40 [2019-02-15 10:45:07,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:45:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-15 10:45:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-02-15 10:45:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-15 10:45:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-02-15 10:45:07,268 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-02-15 10:45:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:07,268 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-02-15 10:45:07,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-15 10:45:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-02-15 10:45:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-15 10:45:07,269 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:07,269 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-15 10:45:07,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:07,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:07,270 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-02-15 10:45:07,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:07,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,528 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-15 10:45:07,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:07,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:07,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:07,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,528 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-15 10:45:07,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:07,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:07,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-15 10:45:07,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:07,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:08,002 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-15 10:45:08,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:08,657 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-15 10:45:08,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:08,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-02-15 10:45:08,676 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:08,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-15 10:45:08,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-15 10:45:08,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-02-15 10:45:08,678 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-02-15 10:45:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:10,589 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-02-15 10:45:10,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 10:45:10,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-02-15 10:45:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:10,590 INFO L225 Difference]: With dead ends: 97 [2019-02-15 10:45:10,590 INFO L226 Difference]: Without dead ends: 58 [2019-02-15 10:45:10,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-02-15 10:45:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-15 10:45:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-02-15 10:45:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-15 10:45:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-02-15 10:45:10,601 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-02-15 10:45:10,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:10,601 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-02-15 10:45:10,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-15 10:45:10,601 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-02-15 10:45:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-15 10:45:10,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:10,603 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-02-15 10:45:10,603 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:10,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-02-15 10:45:10,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:10,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:10,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:11,034 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-15 10:45:11,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:11,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:11,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:11,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,035 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-15 10:45:11,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:11,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:11,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:11,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:11,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:11,257 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-15 10:45:11,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:11,399 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-15 10:45:11,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:11,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-02-15 10:45:11,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:11,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 10:45:11,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 10:45:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:45:11,420 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-02-15 10:45:12,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:12,738 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-02-15 10:45:12,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 10:45:12,739 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-15 10:45:12,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:12,740 INFO L225 Difference]: With dead ends: 94 [2019-02-15 10:45:12,741 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 10:45:12,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-02-15 10:45:12,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 10:45:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-02-15 10:45:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 10:45:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-02-15 10:45:12,750 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-02-15 10:45:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:12,751 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-02-15 10:45:12,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 10:45:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-02-15 10:45:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 10:45:12,752 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:12,752 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-15 10:45:12,752 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:12,753 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-02-15 10:45:12,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:12,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:12,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:12,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:12,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:12,930 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-15 10:45:12,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:12,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:12,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:12,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:12,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:12,930 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-15 10:45:12,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:12,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:12,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:13,071 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-15 10:45:13,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:13,153 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-15 10:45:13,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:13,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-02-15 10:45:13,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:13,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-15 10:45:13,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-15 10:45:13,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:45:13,175 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-02-15 10:45:13,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:13,448 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-02-15 10:45:13,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 10:45:13,448 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-02-15 10:45:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:13,450 INFO L225 Difference]: With dead ends: 105 [2019-02-15 10:45:13,450 INFO L226 Difference]: Without dead ends: 54 [2019-02-15 10:45:13,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-02-15 10:45:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-15 10:45:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-02-15 10:45:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 10:45:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-02-15 10:45:13,460 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-02-15 10:45:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:13,460 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-02-15 10:45:13,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-15 10:45:13,460 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-02-15 10:45:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-15 10:45:13,461 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:13,461 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-15 10:45:13,462 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-02-15 10:45:13,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:13,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:13,821 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-15 10:45:13,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:13,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:13,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:13,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:13,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:13,822 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-15 10:45:13,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:13,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:13,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-15 10:45:13,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:13,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:14,125 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-15 10:45:14,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:14,178 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-15 10:45:14,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:14,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-02-15 10:45:14,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:14,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 10:45:14,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 10:45:14,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-02-15 10:45:14,207 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-02-15 10:45:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:15,546 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-02-15 10:45:15,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 10:45:15,547 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-02-15 10:45:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:15,548 INFO L225 Difference]: With dead ends: 109 [2019-02-15 10:45:15,548 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 10:45:15,549 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-15 10:45:15,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 10:45:15,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-02-15 10:45:15,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-15 10:45:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-02-15 10:45:15,558 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-02-15 10:45:15,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:15,558 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-02-15 10:45:15,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 10:45:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-02-15 10:45:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-15 10:45:15,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:15,559 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-15 10:45:15,560 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:15,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:15,560 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-02-15 10:45:15,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:15,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:15,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:15,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:15,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:15,856 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-15 10:45:15,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:15,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:15,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:15,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:15,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:15,857 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-15 10:45:15,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:15,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:15,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:15,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:15,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:16,047 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-15 10:45:16,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:16,223 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-15 10:45:16,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-02-15 10:45:16,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:16,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 10:45:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 10:45:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-02-15 10:45:16,244 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-02-15 10:45:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:16,589 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-02-15 10:45:16,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 10:45:16,590 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-15 10:45:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:16,591 INFO L225 Difference]: With dead ends: 120 [2019-02-15 10:45:16,591 INFO L226 Difference]: Without dead ends: 61 [2019-02-15 10:45:16,592 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-15 10:45:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-15 10:45:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-02-15 10:45:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 10:45:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-02-15 10:45:16,601 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-02-15 10:45:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:16,601 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-02-15 10:45:16,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 10:45:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-02-15 10:45:16,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-15 10:45:16,602 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:16,602 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-15 10:45:16,602 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:16,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:16,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-02-15 10:45:16,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:16,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:16,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:16,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:17,189 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-15 10:45:17,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:17,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:17,190 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:17,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:17,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:17,190 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-15 10:45:17,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:17,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:17,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:17,434 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-15 10:45:17,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:17,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-15 10:45:17,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:17,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-02-15 10:45:17,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:17,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 10:45:17,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 10:45:17,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-02-15 10:45:17,527 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-02-15 10:45:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:18,962 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-02-15 10:45:18,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 10:45:18,963 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-02-15 10:45:18,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:18,964 INFO L225 Difference]: With dead ends: 124 [2019-02-15 10:45:18,964 INFO L226 Difference]: Without dead ends: 94 [2019-02-15 10:45:18,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-02-15 10:45:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-15 10:45:18,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-02-15 10:45:18,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 10:45:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-02-15 10:45:18,975 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-02-15 10:45:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:18,976 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-02-15 10:45:18,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 10:45:18,976 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-02-15 10:45:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-15 10:45:18,977 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:18,977 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-15 10:45:18,977 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:18,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:18,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-02-15 10:45:18,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:18,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:18,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:18,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:19,219 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-15 10:45:19,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:19,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:19,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:19,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:19,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:19,220 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-15 10:45:19,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:19,229 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:19,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-15 10:45:19,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:19,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:19,464 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-15 10:45:19,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:19,602 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-15 10:45:19,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:19,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-02-15 10:45:19,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:19,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-15 10:45:19,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-15 10:45:19,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-02-15 10:45:19,623 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-02-15 10:45:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:20,086 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-02-15 10:45:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 10:45:20,087 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-02-15 10:45:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:20,088 INFO L225 Difference]: With dead ends: 135 [2019-02-15 10:45:20,088 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 10:45:20,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 10:45:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-02-15 10:45:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-15 10:45:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-02-15 10:45:20,101 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-02-15 10:45:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:20,101 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-02-15 10:45:20,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-15 10:45:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-02-15 10:45:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-15 10:45:20,102 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:20,103 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-15 10:45:20,103 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:20,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-02-15 10:45:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:20,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:20,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:20,528 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-15 10:45:20,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:20,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:20,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:20,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:20,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:20,529 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-15 10:45:20,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:20,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:20,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:20,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:20,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:20,897 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-15 10:45:20,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:20,945 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-15 10:45:20,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:20,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-02-15 10:45:20,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:20,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 10:45:20,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 10:45:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:45:20,965 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-02-15 10:45:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:22,942 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-02-15 10:45:22,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 10:45:22,943 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-02-15 10:45:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:22,943 INFO L225 Difference]: With dead ends: 139 [2019-02-15 10:45:22,943 INFO L226 Difference]: Without dead ends: 105 [2019-02-15 10:45:22,944 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-15 10:45:22,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-15 10:45:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-02-15 10:45:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-15 10:45:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-02-15 10:45:22,953 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-02-15 10:45:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:22,953 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-02-15 10:45:22,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 10:45:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-02-15 10:45:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-15 10:45:22,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:22,954 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-15 10:45:22,955 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:22,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:22,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-02-15 10:45:22,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:22,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:22,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:23,199 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-15 10:45:23,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:23,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:23,199 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:23,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:23,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:23,199 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-15 10:45:23,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:23,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:23,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:23,610 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-15 10:45:23,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:23,764 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-15 10:45:23,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:23,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-02-15 10:45:23,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:23,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 10:45:23,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 10:45:23,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:45:23,784 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-02-15 10:45:24,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:24,160 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-02-15 10:45:24,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 10:45:24,163 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-02-15 10:45:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:24,164 INFO L225 Difference]: With dead ends: 150 [2019-02-15 10:45:24,164 INFO L226 Difference]: Without dead ends: 75 [2019-02-15 10:45:24,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-02-15 10:45:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-15 10:45:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-02-15 10:45:24,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 10:45:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-02-15 10:45:24,174 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-02-15 10:45:24,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:24,174 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-02-15 10:45:24,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 10:45:24,174 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-02-15 10:45:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 10:45:24,175 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:24,175 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-15 10:45:24,175 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:24,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:24,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-02-15 10:45:24,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:24,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:24,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:24,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:24,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,777 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-15 10:45:24,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:24,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:24,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:24,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,778 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-15 10:45:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:24,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:24,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-15 10:45:24,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:24,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:25,665 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-15 10:45:25,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:26,375 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-15 10:45:26,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:26,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-02-15 10:45:26,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:26,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 10:45:26,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 10:45:26,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 10:45:26,396 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-02-15 10:45:29,266 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-15 10:45:31,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:31,123 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-02-15 10:45:31,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 10:45:31,123 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-02-15 10:45:31,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:31,125 INFO L225 Difference]: With dead ends: 192 [2019-02-15 10:45:31,125 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 10:45:31,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 10:45:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 10:45:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-02-15 10:45:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-15 10:45:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-02-15 10:45:31,141 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-02-15 10:45:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:31,141 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-02-15 10:45:31,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 10:45:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-02-15 10:45:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-15 10:45:31,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:31,141 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-02-15 10:45:31,142 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:31,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:31,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-02-15 10:45:31,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:31,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:31,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:31,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:31,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:32,130 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-15 10:45:32,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:32,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:32,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:32,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:32,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:32,130 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-15 10:45:32,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:32,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:32,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:32,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:32,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:32,689 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-15 10:45:32,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:32,746 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-15 10:45:32,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:32,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-02-15 10:45:32,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:32,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 10:45:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 10:45:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:32,766 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-02-15 10:45:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:34,899 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-02-15 10:45:34,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 10:45:34,902 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-02-15 10:45:34,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:34,903 INFO L225 Difference]: With dead ends: 169 [2019-02-15 10:45:34,903 INFO L226 Difference]: Without dead ends: 127 [2019-02-15 10:45:34,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-02-15 10:45:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-15 10:45:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-02-15 10:45:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-15 10:45:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-02-15 10:45:34,913 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-02-15 10:45:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:34,913 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-02-15 10:45:34,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 10:45:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-02-15 10:45:34,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-15 10:45:34,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:34,914 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-15 10:45:34,915 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-02-15 10:45:34,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:34,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:34,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:35,171 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-15 10:45:35,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:35,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:35,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:35,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:35,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:35,171 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-15 10:45:35,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:35,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:35,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:35,474 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-15 10:45:35,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:35,653 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-15 10:45:35,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:35,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-02-15 10:45:35,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:35,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 10:45:35,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 10:45:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:35,673 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-02-15 10:45:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:36,200 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-02-15 10:45:36,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 10:45:36,201 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-02-15 10:45:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:36,202 INFO L225 Difference]: With dead ends: 180 [2019-02-15 10:45:36,202 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:45:36,203 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-15 10:45:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:45:36,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-02-15 10:45:36,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-15 10:45:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-02-15 10:45:36,213 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-02-15 10:45:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:36,213 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-02-15 10:45:36,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 10:45:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-02-15 10:45:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-15 10:45:36,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:36,215 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-15 10:45:36,215 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:36,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:36,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-02-15 10:45:36,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:36,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:36,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:36,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:36,729 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-15 10:45:36,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:36,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:36,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:36,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:36,730 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-15 10:45:36,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:36,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:36,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-15 10:45:36,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:36,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:38,070 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-15 10:45:38,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:39,037 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-15 10:45:39,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:39,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-02-15 10:45:39,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:39,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-15 10:45:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-15 10:45:39,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-02-15 10:45:39,057 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-02-15 10:45:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:45,254 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-02-15 10:45:45,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-15 10:45:45,255 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-02-15 10:45:45,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:45,256 INFO L225 Difference]: With dead ends: 230 [2019-02-15 10:45:45,257 INFO L226 Difference]: Without dead ends: 135 [2019-02-15 10:45:45,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-02-15 10:45:45,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-15 10:45:45,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-02-15 10:45:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-15 10:45:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-02-15 10:45:45,273 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-02-15 10:45:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:45,274 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-02-15 10:45:45,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-15 10:45:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-02-15 10:45:45,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-15 10:45:45,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:45,274 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-02-15 10:45:45,275 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-02-15 10:45:45,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:45,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:45,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:46,118 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-15 10:45:46,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:46,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:46,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:46,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:46,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:46,119 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-15 10:45:46,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:46,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:46,142 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:46,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:46,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:46,692 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-15 10:45:46,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:46,755 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-15 10:45:46,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:46,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-02-15 10:45:46,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:46,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 10:45:46,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 10:45:46,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:46,775 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-02-15 10:45:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:50,082 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-02-15 10:45:50,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 10:45:50,082 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-02-15 10:45:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:50,083 INFO L225 Difference]: With dead ends: 199 [2019-02-15 10:45:50,083 INFO L226 Difference]: Without dead ends: 149 [2019-02-15 10:45:50,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 10:45:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-15 10:45:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-02-15 10:45:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 10:45:50,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-02-15 10:45:50,099 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-02-15 10:45:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:50,099 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-02-15 10:45:50,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 10:45:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-02-15 10:45:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-15 10:45:50,100 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:50,100 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-15 10:45:50,100 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:50,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:50,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-02-15 10:45:50,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:50,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:50,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:50,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:50,440 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-15 10:45:50,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:50,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:50,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:50,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:50,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:50,441 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-15 10:45:50,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:50,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:50,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:50,819 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-15 10:45:50,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:52,114 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-15 10:45:52,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:52,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-02-15 10:45:52,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:52,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 10:45:52,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 10:45:52,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:52,134 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-02-15 10:45:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:52,901 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-02-15 10:45:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 10:45:52,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-02-15 10:45:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:52,903 INFO L225 Difference]: With dead ends: 210 [2019-02-15 10:45:52,903 INFO L226 Difference]: Without dead ends: 103 [2019-02-15 10:45:52,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-02-15 10:45:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-15 10:45:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-02-15 10:45:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-15 10:45:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-02-15 10:45:52,919 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-02-15 10:45:52,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:52,919 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-02-15 10:45:52,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 10:45:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-02-15 10:45:52,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-15 10:45:52,920 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:52,920 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-15 10:45:52,920 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-02-15 10:45:52,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:52,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:52,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:52,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:53,584 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-15 10:45:53,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:53,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:53,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:53,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:53,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:53,585 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-15 10:45:53,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:53,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:53,625 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-15 10:45:53,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:53,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:54,285 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-15 10:45:54,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:54,365 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-15 10:45:54,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:54,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-02-15 10:45:54,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:54,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 10:45:54,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 10:45:54,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 10:45:54,396 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-02-15 10:45:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:57,838 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-02-15 10:45:57,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 10:45:57,838 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-02-15 10:45:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:57,840 INFO L225 Difference]: With dead ends: 214 [2019-02-15 10:45:57,840 INFO L226 Difference]: Without dead ends: 160 [2019-02-15 10:45:57,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-02-15 10:45:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-15 10:45:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-02-15 10:45:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 10:45:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-02-15 10:45:57,856 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-02-15 10:45:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:57,857 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-02-15 10:45:57,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 10:45:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-02-15 10:45:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-15 10:45:57,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:57,857 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-15 10:45:57,858 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-02-15 10:45:57,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:57,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:57,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:57,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:57,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:57,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:58,508 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-15 10:45:58,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:58,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:58,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:58,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:58,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:58,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:45:58,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:58,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:58,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:58,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:58,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:58,948 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-15 10:45:58,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:59,218 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-15 10:45:59,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:59,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-02-15 10:45:59,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:59,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-15 10:45:59,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-15 10:45:59,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 10:45:59,238 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-02-15 10:45:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:59,857 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-02-15 10:45:59,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 10:45:59,857 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-02-15 10:45:59,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:59,858 INFO L225 Difference]: With dead ends: 225 [2019-02-15 10:45:59,858 INFO L226 Difference]: Without dead ends: 110 [2019-02-15 10:45:59,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:59,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-15 10:45:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-02-15 10:45:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-15 10:45:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-02-15 10:45:59,875 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-02-15 10:45:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:59,875 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-02-15 10:45:59,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-15 10:45:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-02-15 10:45:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-15 10:45:59,875 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:59,876 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-15 10:45:59,876 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:59,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-02-15 10:45:59,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:59,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:59,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:59,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:59,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:00,776 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-15 10:46:00,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:00,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:00,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:00,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:00,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:00,777 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-15 10:46:00,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:00,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:00,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:01,445 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-15 10:46:01,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:01,524 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-15 10:46:01,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:01,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-02-15 10:46:01,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:01,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 10:46:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 10:46:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:46:01,543 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-02-15 10:46:06,263 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-02-15 10:46:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:06,559 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-02-15 10:46:06,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 10:46:06,559 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-02-15 10:46:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:06,561 INFO L225 Difference]: With dead ends: 229 [2019-02-15 10:46:06,561 INFO L226 Difference]: Without dead ends: 171 [2019-02-15 10:46:06,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:46:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-15 10:46:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-02-15 10:46:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-15 10:46:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-02-15 10:46:06,577 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-02-15 10:46:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:06,577 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-02-15 10:46:06,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 10:46:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-02-15 10:46:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-15 10:46:06,577 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:06,578 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-15 10:46:06,578 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:06,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:06,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-02-15 10:46:06,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:06,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:06,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:06,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:06,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:07,062 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-15 10:46:07,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:07,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:07,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:07,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:07,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:07,063 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-15 10:46:07,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:07,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:07,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-15 10:46:07,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:07,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:07,562 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-15 10:46:07,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:07,868 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-15 10:46:07,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:07,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-02-15 10:46:07,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:07,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 10:46:07,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 10:46:07,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:46:07,887 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-02-15 10:46:08,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:08,717 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-02-15 10:46:08,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 10:46:08,720 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-02-15 10:46:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:08,721 INFO L225 Difference]: With dead ends: 240 [2019-02-15 10:46:08,721 INFO L226 Difference]: Without dead ends: 117 [2019-02-15 10:46:08,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-02-15 10:46:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-15 10:46:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-02-15 10:46:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-15 10:46:08,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-02-15 10:46:08,744 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-02-15 10:46:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:08,744 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-02-15 10:46:08,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 10:46:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-02-15 10:46:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-15 10:46:08,745 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:08,745 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-15 10:46:08,745 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:08,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:08,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-02-15 10:46:08,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:08,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:08,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:08,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:09,625 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-15 10:46:09,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:09,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:09,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:09,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:09,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:09,626 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-15 10:46:09,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:09,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:09,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:09,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:09,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:10,496 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-15 10:46:10,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:10,583 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-15 10:46:10,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:10,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-02-15 10:46:10,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:10,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 10:46:10,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 10:46:10,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 10:46:10,602 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-02-15 10:46:15,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:15,756 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-02-15 10:46:15,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 10:46:15,766 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-02-15 10:46:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:15,767 INFO L225 Difference]: With dead ends: 244 [2019-02-15 10:46:15,767 INFO L226 Difference]: Without dead ends: 182 [2019-02-15 10:46:15,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-02-15 10:46:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-15 10:46:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-02-15 10:46:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-15 10:46:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-02-15 10:46:15,790 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-02-15 10:46:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:15,790 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-02-15 10:46:15,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 10:46:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-02-15 10:46:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-15 10:46:15,791 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:15,791 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-15 10:46:15,791 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:15,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-02-15 10:46:15,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:15,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:15,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:15,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:15,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:16,630 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-15 10:46:16,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:16,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:16,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:16,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:16,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:16,631 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-15 10:46:16,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:16,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:16,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:17,181 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-15 10:46:17,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:17,547 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-15 10:46:17,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:17,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-02-15 10:46:17,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:17,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-15 10:46:17,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-15 10:46:17,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 10:46:17,567 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-02-15 10:46:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:18,698 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-02-15 10:46:18,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 10:46:18,699 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-02-15 10:46:18,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:18,699 INFO L225 Difference]: With dead ends: 255 [2019-02-15 10:46:18,699 INFO L226 Difference]: Without dead ends: 124 [2019-02-15 10:46:18,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-02-15 10:46:18,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-15 10:46:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-02-15 10:46:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-15 10:46:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-02-15 10:46:18,724 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-02-15 10:46:18,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:18,725 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-02-15 10:46:18,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-15 10:46:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-02-15 10:46:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-15 10:46:18,725 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:18,726 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-15 10:46:18,726 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:18,726 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-02-15 10:46:18,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:18,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:18,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:18,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:19,625 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-15 10:46:19,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:19,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:19,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:19,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:19,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:19,626 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-15 10:46:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:19,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:19,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-15 10:46:19,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:19,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:21,621 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-15 10:46:21,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:23,411 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-15 10:46:23,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:23,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-02-15 10:46:23,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:23,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-15 10:46:23,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-15 10:46:23,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 10:46:23,430 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-02-15 10:46:31,579 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-02-15 10:46:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:33,631 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-02-15 10:46:33,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-02-15 10:46:33,632 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-02-15 10:46:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:33,633 INFO L225 Difference]: With dead ends: 325 [2019-02-15 10:46:33,634 INFO L226 Difference]: Without dead ends: 190 [2019-02-15 10:46:33,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:46:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-15 10:46:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-02-15 10:46:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-15 10:46:33,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-02-15 10:46:33,656 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-02-15 10:46:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:33,656 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-02-15 10:46:33,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-15 10:46:33,656 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-02-15 10:46:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-15 10:46:33,656 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:33,656 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-02-15 10:46:33,657 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:33,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:33,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-02-15 10:46:33,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:33,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:33,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:34,981 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-15 10:46:34,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:34,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:34,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:34,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:34,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:34,982 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-15 10:46:34,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:34,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:35,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:35,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:35,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:35,890 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-15 10:46:35,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:36,006 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-15 10:46:36,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:36,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-02-15 10:46:36,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:36,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 10:46:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 10:46:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 10:46:36,025 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-02-15 10:46:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:41,722 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-02-15 10:46:41,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-15 10:46:41,722 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-02-15 10:46:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:41,724 INFO L225 Difference]: With dead ends: 274 [2019-02-15 10:46:41,724 INFO L226 Difference]: Without dead ends: 204 [2019-02-15 10:46:41,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 10:46:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-15 10:46:41,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-02-15 10:46:41,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-15 10:46:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-02-15 10:46:41,746 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-02-15 10:46:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:41,746 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-02-15 10:46:41,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 10:46:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-02-15 10:46:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-15 10:46:41,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:41,747 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-15 10:46:41,747 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:41,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-02-15 10:46:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:41,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:41,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:41,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:43,127 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-15 10:46:43,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:43,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:43,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:43,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:43,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:43,128 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-15 10:46:43,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:43,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:43,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:43,808 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-15 10:46:43,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:44,531 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-15 10:46:44,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:44,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-02-15 10:46:44,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:44,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-15 10:46:44,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-15 10:46:44,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 10:46:44,550 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-02-15 10:46:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:45,443 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-02-15 10:46:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 10:46:45,444 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-02-15 10:46:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:45,445 INFO L225 Difference]: With dead ends: 285 [2019-02-15 10:46:45,445 INFO L226 Difference]: Without dead ends: 138 [2019-02-15 10:46:45,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-02-15 10:46:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-15 10:46:45,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-02-15 10:46:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-15 10:46:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-02-15 10:46:45,472 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-02-15 10:46:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:45,472 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-02-15 10:46:45,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-15 10:46:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-02-15 10:46:45,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-15 10:46:45,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:45,473 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-15 10:46:45,474 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:45,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:45,474 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-02-15 10:46:45,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:45,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:45,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:45,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:45,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:46,481 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-15 10:46:46,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:46,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:46,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:46,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:46,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:46,482 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-15 10:46:46,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:46,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:46,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-15 10:46:46,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:46,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:48,922 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-15 10:46:48,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:51,395 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-15 10:46:51,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:51,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-02-15 10:46:51,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:51,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-15 10:46:51,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-15 10:46:51,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:51,415 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-02-15 10:47:02,139 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-15 10:47:02,420 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-15 10:47:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:05,086 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-02-15 10:47:05,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-02-15 10:47:05,086 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-02-15 10:47:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:05,088 INFO L225 Difference]: With dead ends: 363 [2019-02-15 10:47:05,088 INFO L226 Difference]: Without dead ends: 212 [2019-02-15 10:47:05,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-02-15 10:47:05,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-15 10:47:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-02-15 10:47:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-15 10:47:05,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-02-15 10:47:05,112 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-02-15 10:47:05,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:05,112 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-02-15 10:47:05,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-15 10:47:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-02-15 10:47:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-15 10:47:05,112 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:05,113 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-02-15 10:47:05,113 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-02-15 10:47:05,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:05,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:05,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:05,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:05,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:06,360 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-15 10:47:06,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:06,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:06,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:06,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:06,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:06,361 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-15 10:47:06,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:06,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:06,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:06,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:06,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:08,698 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-15 10:47:08,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:08,812 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-15 10:47:08,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:08,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-02-15 10:47:08,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:08,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 10:47:08,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 10:47:08,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-02-15 10:47:08,832 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-02-15 10:47:13,232 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-15 10:47:13,517 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-15 10:47:13,775 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-15 10:47:13,965 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-15 10:47:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:15,813 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-02-15 10:47:15,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-15 10:47:15,813 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-02-15 10:47:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:15,815 INFO L225 Difference]: With dead ends: 304 [2019-02-15 10:47:15,815 INFO L226 Difference]: Without dead ends: 226 [2019-02-15 10:47:15,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-02-15 10:47:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-15 10:47:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-02-15 10:47:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-15 10:47:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-02-15 10:47:15,844 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-02-15 10:47:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:15,844 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-02-15 10:47:15,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 10:47:15,844 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-02-15 10:47:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-15 10:47:15,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:15,845 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-15 10:47:15,845 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:15,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-02-15 10:47:15,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:15,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:15,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:15,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:15,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:16,609 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-15 10:47:16,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:16,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:16,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:16,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:16,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:16,609 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-15 10:47:16,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:16,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:16,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:17,435 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-15 10:47:17,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:17,974 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-15 10:47:17,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:17,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-02-15 10:47:17,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:17,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-15 10:47:17,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-15 10:47:17,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-02-15 10:47:17,994 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-02-15 10:47:19,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:19,280 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-02-15 10:47:19,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 10:47:19,281 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-02-15 10:47:19,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:19,282 INFO L225 Difference]: With dead ends: 315 [2019-02-15 10:47:19,282 INFO L226 Difference]: Without dead ends: 152 [2019-02-15 10:47:19,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:47:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-15 10:47:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-02-15 10:47:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-02-15 10:47:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-02-15 10:47:19,315 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-02-15 10:47:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:19,315 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-02-15 10:47:19,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-15 10:47:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-02-15 10:47:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-02-15 10:47:19,316 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:19,317 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-15 10:47:19,317 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:19,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:19,317 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-02-15 10:47:19,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:19,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:19,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:19,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:20,830 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-15 10:47:20,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:20,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:20,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:20,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:20,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:20,831 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-15 10:47:20,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:20,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:21,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-15 10:47:21,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:21,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:23,821 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-15 10:47:23,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:26,670 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-15 10:47:26,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:26,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-02-15 10:47:26,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:26,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-15 10:47:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-15 10:47:26,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 10:47:26,690 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-02-15 10:47:38,355 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-15 10:47:38,674 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-15 10:47:38,985 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-15 10:47:39,250 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:47:39,511 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-15 10:47:40,510 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-02-15 10:47:42,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:42,008 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-02-15 10:47:42,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-02-15 10:47:42,008 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-02-15 10:47:42,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:42,009 INFO L225 Difference]: With dead ends: 401 [2019-02-15 10:47:42,009 INFO L226 Difference]: Without dead ends: 234 [2019-02-15 10:47:42,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-02-15 10:47:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-15 10:47:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-02-15 10:47:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-15 10:47:42,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-02-15 10:47:42,048 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-02-15 10:47:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:42,048 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-02-15 10:47:42,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-15 10:47:42,049 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-02-15 10:47:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-15 10:47:42,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:42,050 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-02-15 10:47:42,050 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:42,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:42,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-02-15 10:47:42,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:42,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:42,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:42,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:44,094 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-15 10:47:44,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:44,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:44,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:44,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:44,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:44,095 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-15 10:47:44,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:44,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:44,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:44,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:44,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:45,443 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-15 10:47:45,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:45,601 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-15 10:47:45,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:45,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-02-15 10:47:45,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:45,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 10:47:45,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 10:47:45,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 10:47:45,620 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-02-15 10:47:51,356 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-15 10:47:51,676 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-15 10:47:51,972 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-15 10:47:52,172 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:47:52,360 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:47:52,730 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-15 10:47:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:54,343 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-02-15 10:47:54,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-15 10:47:54,343 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-02-15 10:47:54,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:54,345 INFO L225 Difference]: With dead ends: 334 [2019-02-15 10:47:54,345 INFO L226 Difference]: Without dead ends: 248 [2019-02-15 10:47:54,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-02-15 10:47:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-15 10:47:54,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-02-15 10:47:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-15 10:47:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-02-15 10:47:54,373 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-02-15 10:47:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:54,374 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-02-15 10:47:54,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 10:47:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-02-15 10:47:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-15 10:47:54,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:54,375 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-15 10:47:54,375 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:54,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-02-15 10:47:54,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:54,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:54,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:55,244 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-15 10:47:55,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:55,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:55,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:55,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:55,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:55,244 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-15 10:47:55,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:55,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:55,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:56,169 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-15 10:47:56,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:56,807 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-15 10:47:56,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:56,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-02-15 10:47:56,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:56,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-15 10:47:56,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-15 10:47:56,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 10:47:56,828 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-02-15 10:47:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:58,432 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-02-15 10:47:58,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 10:47:58,434 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-02-15 10:47:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:58,436 INFO L225 Difference]: With dead ends: 345 [2019-02-15 10:47:58,436 INFO L226 Difference]: Without dead ends: 166 [2019-02-15 10:47:58,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-02-15 10:47:58,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-15 10:47:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-02-15 10:47:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-15 10:47:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-02-15 10:47:58,462 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-02-15 10:47:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:58,462 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-02-15 10:47:58,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-15 10:47:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-02-15 10:47:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-02-15 10:47:58,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:58,463 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-15 10:47:58,463 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-02-15 10:47:58,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:58,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:58,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:58,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:58,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:00,231 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-15 10:48:00,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:00,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:00,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:00,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:00,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:00,231 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-15 10:48:00,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:00,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:00,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-15 10:48:00,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:00,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:01,986 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-15 10:48:01,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:02,123 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-15 10:48:02,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:02,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-02-15 10:48:02,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:02,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 10:48:02,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 10:48:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:48:02,143 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-02-15 10:48:09,089 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-15 10:48:09,421 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-15 10:48:09,730 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-15 10:48:09,944 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:48:10,145 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:48:10,343 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:48:11,106 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-15 10:48:11,296 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-02-15 10:48:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:12,495 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-02-15 10:48:12,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-15 10:48:12,495 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-02-15 10:48:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:12,497 INFO L225 Difference]: With dead ends: 349 [2019-02-15 10:48:12,497 INFO L226 Difference]: Without dead ends: 259 [2019-02-15 10:48:12,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-02-15 10:48:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-15 10:48:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-02-15 10:48:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-02-15 10:48:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-02-15 10:48:12,527 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-02-15 10:48:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:12,527 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-02-15 10:48:12,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 10:48:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-02-15 10:48:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-02-15 10:48:12,528 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:12,528 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-15 10:48:12,528 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:12,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:12,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-02-15 10:48:12,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:12,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:12,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:13,723 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-15 10:48:13,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:13,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:13,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:13,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:13,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:13,724 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-15 10:48:13,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:13,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:13,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:13,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:13,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:14,741 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-15 10:48:14,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:15,418 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-15 10:48:15,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:15,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-02-15 10:48:15,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:15,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 10:48:15,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 10:48:15,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:48:15,448 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-02-15 10:48:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:17,417 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-02-15 10:48:17,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 10:48:17,417 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-02-15 10:48:17,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:17,419 INFO L225 Difference]: With dead ends: 360 [2019-02-15 10:48:17,419 INFO L226 Difference]: Without dead ends: 173 [2019-02-15 10:48:17,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:48:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-15 10:48:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-02-15 10:48:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-15 10:48:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-02-15 10:48:17,450 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-02-15 10:48:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:17,450 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-02-15 10:48:17,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 10:48:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-02-15 10:48:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-15 10:48:17,451 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:17,451 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-15 10:48:17,452 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-02-15 10:48:17,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:17,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:17,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:17,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:19,052 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-15 10:48:19,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:19,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:19,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:19,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:19,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:19,053 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-15 10:48:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:19,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:19,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:20,716 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-15 10:48:20,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:20,862 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-15 10:48:20,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:20,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-02-15 10:48:20,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:20,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 10:48:20,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 10:48:20,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-02-15 10:48:20,883 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-02-15 10:48:28,452 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-15 10:48:28,785 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-15 10:48:29,107 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-15 10:48:29,322 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:48:29,527 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:48:29,733 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:48:29,939 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:48:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:32,030 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-02-15 10:48:32,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-15 10:48:32,030 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-02-15 10:48:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:32,032 INFO L225 Difference]: With dead ends: 364 [2019-02-15 10:48:32,032 INFO L226 Difference]: Without dead ends: 270 [2019-02-15 10:48:32,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-02-15 10:48:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-15 10:48:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-02-15 10:48:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-15 10:48:32,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-02-15 10:48:32,063 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-02-15 10:48:32,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:32,064 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-02-15 10:48:32,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 10:48:32,064 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-02-15 10:48:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-15 10:48:32,064 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:32,064 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-15 10:48:32,065 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:32,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:32,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-02-15 10:48:32,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:32,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:32,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:32,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:32,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:33,610 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-15 10:48:33,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:33,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:33,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:33,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:33,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:33,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 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-15 10:48:33,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:33,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:33,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-15 10:48:33,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:33,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:34,981 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-15 10:48:34,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:35,735 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-15 10:48:35,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:35,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-02-15 10:48:35,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:35,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-15 10:48:35,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-15 10:48:35,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-02-15 10:48:35,756 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-02-15 10:48:37,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:37,819 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-02-15 10:48:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 10:48:37,819 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-02-15 10:48:37,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:37,821 INFO L225 Difference]: With dead ends: 375 [2019-02-15 10:48:37,821 INFO L226 Difference]: Without dead ends: 180 [2019-02-15 10:48:37,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-02-15 10:48:37,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-15 10:48:37,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-02-15 10:48:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-15 10:48:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-02-15 10:48:37,853 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-02-15 10:48:37,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:37,853 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-02-15 10:48:37,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-15 10:48:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-02-15 10:48:37,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-15 10:48:37,854 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:37,854 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-15 10:48:37,854 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-02-15 10:48:37,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:37,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:37,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:37,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:39,401 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-15 10:48:39,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:39,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:39,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:39,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:39,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:39,402 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-15 10:48:39,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:39,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:39,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:39,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:39,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:41,069 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-15 10:48:41,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:41,230 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-15 10:48:41,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:41,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-02-15 10:48:41,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:41,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 10:48:41,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 10:48:41,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:48:41,249 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-02-15 10:48:47,886 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-15 10:48:48,237 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-15 10:48:48,575 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-15 10:48:48,808 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:48:49,031 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:48:49,244 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:48:49,454 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:48:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:51,786 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-02-15 10:48:51,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 10:48:51,786 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-02-15 10:48:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:51,788 INFO L225 Difference]: With dead ends: 379 [2019-02-15 10:48:51,788 INFO L226 Difference]: Without dead ends: 281 [2019-02-15 10:48:51,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-02-15 10:48:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-15 10:48:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-02-15 10:48:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-15 10:48:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-02-15 10:48:51,827 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-02-15 10:48:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:51,828 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-02-15 10:48:51,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 10:48:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-02-15 10:48:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-15 10:48:51,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:51,829 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-15 10:48:51,829 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:51,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:51,830 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-02-15 10:48:51,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:51,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:51,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:52,867 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-15 10:48:52,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:52,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:52,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:52,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:52,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:52,868 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-15 10:48:52,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:52,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:52,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:53,983 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-15 10:48:53,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:54,798 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-15 10:48:54,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:54,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-02-15 10:48:54,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:54,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 10:48:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 10:48:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:48:54,817 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-02-15 10:48:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:56,719 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-02-15 10:48:56,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 10:48:56,720 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-02-15 10:48:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:56,721 INFO L225 Difference]: With dead ends: 390 [2019-02-15 10:48:56,721 INFO L226 Difference]: Without dead ends: 187 [2019-02-15 10:48:56,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-02-15 10:48:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-15 10:48:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-02-15 10:48:56,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-15 10:48:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-02-15 10:48:56,760 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-02-15 10:48:56,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:56,760 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-02-15 10:48:56,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 10:48:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-02-15 10:48:56,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-15 10:48:56,761 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:56,761 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-15 10:48:56,761 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:56,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-02-15 10:48:56,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:56,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:56,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:56,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:56,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:58,887 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-15 10:48:58,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:58,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:58,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:58,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:58,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:58,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 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-15 10:48:58,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:58,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:58,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-15 10:48:58,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:58,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:03,311 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-15 10:49:03,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:07,245 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-15 10:49:07,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:07,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-02-15 10:49:07,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:07,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-15 10:49:07,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-15 10:49:07,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-02-15 10:49:07,266 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-02-15 10:49:25,057 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-15 10:49:25,492 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-15 10:49:25,943 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-15 10:49:26,321 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:49:26,693 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:49:27,034 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:49:27,362 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:49:27,686 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:49:28,102 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:49:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:31,196 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-02-15 10:49:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-02-15 10:49:31,197 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-02-15 10:49:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:31,198 INFO L225 Difference]: With dead ends: 496 [2019-02-15 10:49:31,198 INFO L226 Difference]: Without dead ends: 289 [2019-02-15 10:49:31,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 27.6s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-02-15 10:49:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-15 10:49:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-02-15 10:49:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-15 10:49:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-02-15 10:49:31,246 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-02-15 10:49:31,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:31,246 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-02-15 10:49:31,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-15 10:49:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-02-15 10:49:31,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-15 10:49:31,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:31,247 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-02-15 10:49:31,247 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:31,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:31,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-02-15 10:49:31,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:31,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:31,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:31,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:33,094 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-15 10:49:33,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:33,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:33,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:33,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:33,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:33,095 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-15 10:49:33,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:33,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:33,135 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:33,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:33,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:35,085 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-15 10:49:35,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:35,350 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-15 10:49:35,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:35,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-02-15 10:49:35,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:35,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 10:49:35,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 10:49:35,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:49:35,370 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-02-15 10:49:43,828 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-15 10:49:44,218 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-15 10:49:44,610 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-15 10:49:44,873 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:49:45,129 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:49:45,376 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:49:45,618 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:49:45,847 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:49:46,071 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:49:46,283 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:49:46,497 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-15 10:49:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:48,713 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-02-15 10:49:48,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-15 10:49:48,713 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-02-15 10:49:48,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:48,715 INFO L225 Difference]: With dead ends: 409 [2019-02-15 10:49:48,715 INFO L226 Difference]: Without dead ends: 303 [2019-02-15 10:49:48,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 10:49:48,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-02-15 10:49:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-02-15 10:49:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-15 10:49:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-02-15 10:49:48,754 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-02-15 10:49:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:48,754 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-02-15 10:49:48,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 10:49:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-02-15 10:49:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-15 10:49:48,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:48,755 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-15 10:49:48,755 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:48,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-02-15 10:49:48,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:48,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:48,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:48,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:48,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:49,821 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-15 10:49:49,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:49,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:49,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:49,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:49,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:49,822 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-15 10:49:49,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:49,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:49,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:51,238 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-15 10:49:51,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:52,170 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-15 10:49:52,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:52,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-02-15 10:49:52,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:52,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 10:49:52,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 10:49:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:49:52,189 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-02-15 10:49:54,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:54,680 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-02-15 10:49:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 10:49:54,680 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-02-15 10:49:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:54,682 INFO L225 Difference]: With dead ends: 420 [2019-02-15 10:49:54,682 INFO L226 Difference]: Without dead ends: 201 [2019-02-15 10:49:54,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-02-15 10:49:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-15 10:49:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-02-15 10:49:54,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-15 10:49:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-02-15 10:49:54,720 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-02-15 10:49:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:54,720 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-02-15 10:49:54,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 10:49:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-02-15 10:49:54,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-15 10:49:54,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:54,721 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-15 10:49:54,721 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:54,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:54,721 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-02-15 10:49:54,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:54,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:54,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:54,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:54,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:56,584 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-15 10:49:56,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:56,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:56,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:56,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:56,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:56,585 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-15 10:49:56,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:56,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:56,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-15 10:49:56,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:56,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:58,661 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-15 10:49:58,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:58,975 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-15 10:49:58,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:58,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-02-15 10:49:58,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:58,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 10:49:58,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 10:49:58,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-02-15 10:49:58,995 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-02-15 10:50:07,630 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-15 10:50:08,036 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-15 10:50:08,442 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-15 10:50:08,752 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:50:09,079 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:50:09,340 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:50:09,593 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:50:09,838 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:50:10,079 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:50:10,311 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:50:10,532 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:50:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:12,850 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-02-15 10:50:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-02-15 10:50:12,851 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-02-15 10:50:12,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:12,853 INFO L225 Difference]: With dead ends: 424 [2019-02-15 10:50:12,853 INFO L226 Difference]: Without dead ends: 314 [2019-02-15 10:50:12,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-02-15 10:50:12,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-15 10:50:12,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-02-15 10:50:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-15 10:50:12,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-02-15 10:50:12,900 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-02-15 10:50:12,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:12,900 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-02-15 10:50:12,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 10:50:12,900 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-02-15 10:50:12,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-15 10:50:12,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:12,902 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-15 10:50:12,902 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:12,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:12,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-02-15 10:50:12,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:12,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:12,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:14,256 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-15 10:50:14,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:14,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:14,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:14,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:14,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:14,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 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-15 10:50:14,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:14,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:14,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:14,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:14,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:15,694 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-15 10:50:15,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:16,738 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-15 10:50:16,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:16,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-02-15 10:50:16,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:16,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-15 10:50:16,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-15 10:50:16,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-02-15 10:50:16,757 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-02-15 10:50:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:19,319 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-02-15 10:50:19,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 10:50:19,319 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-02-15 10:50:19,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:19,320 INFO L225 Difference]: With dead ends: 435 [2019-02-15 10:50:19,320 INFO L226 Difference]: Without dead ends: 208 [2019-02-15 10:50:19,322 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-15 10:50:19,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-15 10:50:19,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-02-15 10:50:19,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-15 10:50:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-02-15 10:50:19,370 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-02-15 10:50:19,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:19,371 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-02-15 10:50:19,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-15 10:50:19,371 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-02-15 10:50:19,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-15 10:50:19,372 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:19,372 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-15 10:50:19,372 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:19,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-02-15 10:50:19,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:19,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:19,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:19,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:21,388 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-15 10:50:21,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:21,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:21,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:21,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:21,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:21,389 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-15 10:50:21,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:21,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:21,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:23,928 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-15 10:50:23,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:24,214 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-15 10:50:24,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:24,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-02-15 10:50:24,232 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:24,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 10:50:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 10:50:24,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:50:24,234 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-02-15 10:50:33,111 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-15 10:50:33,542 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-15 10:50:33,973 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-15 10:50:34,283 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:50:34,630 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:50:34,917 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:50:35,193 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:50:35,451 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:50:35,700 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:50:35,941 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:50:36,184 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:50:36,412 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:50:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:38,893 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-02-15 10:50:38,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-02-15 10:50:38,894 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-02-15 10:50:38,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:38,895 INFO L225 Difference]: With dead ends: 439 [2019-02-15 10:50:38,896 INFO L226 Difference]: Without dead ends: 325 [2019-02-15 10:50:38,896 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-15 10:50:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-15 10:50:38,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-02-15 10:50:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-15 10:50:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-02-15 10:50:38,947 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-02-15 10:50:38,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:38,947 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-02-15 10:50:38,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 10:50:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-02-15 10:50:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-02-15 10:50:38,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:38,949 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-15 10:50:38,949 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:38,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:38,949 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-02-15 10:50:38,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:38,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:38,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:40,865 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-15 10:50:40,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:40,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:40,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:40,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:40,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:40,866 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-15 10:50:40,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:40,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:40,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-15 10:50:40,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:40,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:42,405 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-15 10:50:42,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:43,549 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-15 10:50:43,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:43,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-02-15 10:50:43,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:43,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 10:50:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 10:50:43,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:50:43,570 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-02-15 10:50:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:46,387 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-02-15 10:50:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 10:50:46,388 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-02-15 10:50:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:46,389 INFO L225 Difference]: With dead ends: 450 [2019-02-15 10:50:46,389 INFO L226 Difference]: Without dead ends: 215 [2019-02-15 10:50:46,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 10:50:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-15 10:50:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-02-15 10:50:46,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-15 10:50:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-02-15 10:50:46,438 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-02-15 10:50:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:46,438 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-02-15 10:50:46,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 10:50:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-02-15 10:50:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-15 10:50:46,439 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:46,439 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-15 10:50:46,440 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-02-15 10:50:46,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:46,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:46,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:48,518 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-15 10:50:48,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:48,518 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:48,518 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:48,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:48,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:48,519 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-15 10:50:48,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:48,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:48,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:48,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:48,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:51,220 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-15 10:50:51,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:51,469 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-15 10:50:51,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:51,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-02-15 10:50:51,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:51,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 10:50:51,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 10:50:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 10:50:51,488 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-02-15 10:51:01,605 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-15 10:51:02,059 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-15 10:51:02,523 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-15 10:51:02,842 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:51:03,145 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:51:03,448 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:51:03,740 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:51:04,022 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:51:04,293 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:51:04,547 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:51:04,794 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:51:05,056 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:51:05,353 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:51:07,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:07,844 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-02-15 10:51:07,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-02-15 10:51:07,844 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-02-15 10:51:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:07,847 INFO L225 Difference]: With dead ends: 454 [2019-02-15 10:51:07,847 INFO L226 Difference]: Without dead ends: 336 [2019-02-15 10:51:07,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-02-15 10:51:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-02-15 10:51:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-02-15 10:51:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-15 10:51:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-02-15 10:51:07,899 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-02-15 10:51:07,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:07,899 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-02-15 10:51:07,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 10:51:07,899 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-02-15 10:51:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-15 10:51:07,900 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:07,900 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-15 10:51:07,900 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:07,900 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-02-15 10:51:07,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:07,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:07,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:07,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:09,102 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-15 10:51:09,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:09,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:09,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:09,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:09,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:09,103 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-15 10:51:09,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:09,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:09,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:10,892 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-15 10:51:10,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:12,050 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-15 10:51:12,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:12,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-02-15 10:51:12,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:12,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-15 10:51:12,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-15 10:51:12,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 10:51:12,070 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-02-15 10:51:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:14,757 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-02-15 10:51:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 10:51:14,758 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-02-15 10:51:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:14,759 INFO L225 Difference]: With dead ends: 465 [2019-02-15 10:51:14,759 INFO L226 Difference]: Without dead ends: 222 [2019-02-15 10:51:14,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-02-15 10:51:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-15 10:51:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-02-15 10:51:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-15 10:51:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-02-15 10:51:14,803 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-02-15 10:51:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:14,803 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-02-15 10:51:14,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-15 10:51:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-02-15 10:51:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-15 10:51:14,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:14,804 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-15 10:51:14,804 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:14,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:14,805 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-02-15 10:51:14,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:14,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:14,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:14,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:14,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:17,354 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-15 10:51:17,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:17,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:17,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:17,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:17,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:17,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 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-15 10:51:17,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:17,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:17,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-15 10:51:17,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:17,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:23,308 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-15 10:51:23,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:28,756 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-15 10:51:28,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:28,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-02-15 10:51:28,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:28,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-15 10:51:28,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-15 10:51:28,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 10:51:28,777 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-02-15 10:51:46,321 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-02-15 10:51:52,840 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-15 10:51:53,414 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-15 10:51:54,005 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-15 10:51:54,547 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 10:51:55,030 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:51:55,502 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:51:55,969 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:51:56,475 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:51:56,949 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:51:57,386 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:51:57,786 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:51:58,166 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:51:58,524 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:52:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:02,433 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-02-15 10:52:02,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-02-15 10:52:02,433 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-02-15 10:52:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:02,435 INFO L225 Difference]: With dead ends: 591 [2019-02-15 10:52:02,435 INFO L226 Difference]: Without dead ends: 344 [2019-02-15 10:52:02,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-02-15 10:52:02,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-15 10:52:02,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-02-15 10:52:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-15 10:52:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-02-15 10:52:02,485 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-02-15 10:52:02,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:02,485 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-02-15 10:52:02,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-15 10:52:02,485 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-02-15 10:52:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-15 10:52:02,486 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:02,487 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-02-15 10:52:02,487 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:02,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:02,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-02-15 10:52:02,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:02,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:02,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:02,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:04,851 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-15 10:52:04,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:04,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:04,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:04,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:04,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:04,852 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-15 10:52:04,861 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:52:04,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:52:04,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:52:04,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:04,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:07,565 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-15 10:52:07,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:07,783 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-15 10:52:07,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-02-15 10:52:07,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:07,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 10:52:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 10:52:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 10:52:07,804 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-02-15 10:52:20,671 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-15 10:52:21,192 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-15 10:52:21,684 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-15 10:52:22,085 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 10:52:22,410 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 10:52:22,738 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:52:23,056 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:52:23,368 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:52:23,670 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:52:23,963 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:52:24,247 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:52:24,519 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:52:24,787 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:52:25,071 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:52:25,314 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:52:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:28,170 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-02-15 10:52:28,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-02-15 10:52:28,170 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-02-15 10:52:28,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:28,171 INFO L225 Difference]: With dead ends: 484 [2019-02-15 10:52:28,172 INFO L226 Difference]: Without dead ends: 358 [2019-02-15 10:52:28,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-02-15 10:52:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-15 10:52:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-02-15 10:52:28,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-15 10:52:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-02-15 10:52:28,223 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-02-15 10:52:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:28,224 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-02-15 10:52:28,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 10:52:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-02-15 10:52:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-15 10:52:28,225 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:28,225 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-15 10:52:28,225 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:28,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:28,226 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-02-15 10:52:28,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:28,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:28,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:28,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:28,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:29,775 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-15 10:52:29,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:29,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:29,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:29,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:29,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:29,776 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-15 10:52:29,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:29,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:29,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:33,261 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-15 10:52:33,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:34,773 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-15 10:52:34,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:34,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-02-15 10:52:34,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:34,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-15 10:52:34,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-15 10:52:34,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 10:52:34,792 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-02-15 10:52:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:37,063 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-02-15 10:52:37,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 10:52:37,063 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-02-15 10:52:37,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:37,064 INFO L225 Difference]: With dead ends: 495 [2019-02-15 10:52:37,065 INFO L226 Difference]: Without dead ends: 236 [2019-02-15 10:52:37,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 10:52:37,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-15 10:52:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-02-15 10:52:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-15 10:52:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-02-15 10:52:37,123 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-02-15 10:52:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:37,124 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-02-15 10:52:37,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-15 10:52:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-02-15 10:52:37,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-02-15 10:52:37,124 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:37,125 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-15 10:52:37,125 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:37,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:37,125 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-02-15 10:52:37,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:37,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:37,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:39,824 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-15 10:52:39,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:39,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:39,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:39,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:39,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:39,825 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-15 10:52:39,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:52:39,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:52:39,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-15 10:52:39,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:39,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:46,617 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-15 10:52:46,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:53,230 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-15 10:52:53,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:53,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-02-15 10:52:53,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:53,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-15 10:52:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-15 10:52:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 10:52:53,251 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-02-15 10:53:18,378 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-15 10:53:19,010 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-15 10:53:19,629 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-15 10:53:20,194 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 10:53:20,759 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 10:53:21,303 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 10:53:21,812 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:53:22,303 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:53:22,774 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:53:23,230 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:53:23,696 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:53:24,116 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:53:24,521 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:53:24,911 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:53:25,285 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:53:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:29,439 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-02-15 10:53:29,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-02-15 10:53:29,439 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-02-15 10:53:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:29,441 INFO L225 Difference]: With dead ends: 629 [2019-02-15 10:53:29,441 INFO L226 Difference]: Without dead ends: 366 [2019-02-15 10:53:29,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-02-15 10:53:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-15 10:53:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-02-15 10:53:29,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-15 10:53:29,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-02-15 10:53:29,497 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-02-15 10:53:29,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:29,497 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-02-15 10:53:29,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-15 10:53:29,497 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-02-15 10:53:29,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-15 10:53:29,498 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:29,498 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-02-15 10:53:29,498 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:29,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:29,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-02-15 10:53:29,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:29,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:29,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:29,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:32,173 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-15 10:53:32,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:32,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:32,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:32,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:32,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:32,173 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-15 10:53:32,185 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:53:32,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:53:32,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:53:32,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:32,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:35,193 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-15 10:53:35,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:35,433 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-15 10:53:35,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:35,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-02-15 10:53:35,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:35,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 10:53:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 10:53:35,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 10:53:35,453 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-02-15 10:53:47,361 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-15 10:53:47,913 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-15 10:53:48,456 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-15 10:53:48,851 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 10:53:49,286 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 10:53:49,648 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 10:53:49,987 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 10:53:50,322 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:53:50,644 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:53:50,958 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:53:51,265 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:53:51,562 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:53:51,848 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:53:52,127 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:53:52,393 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:53:52,665 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:53:54,079 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-02-15 10:53:55,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:55,766 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-02-15 10:53:55,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-02-15 10:53:55,766 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-02-15 10:53:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:55,767 INFO L225 Difference]: With dead ends: 514 [2019-02-15 10:53:55,767 INFO L226 Difference]: Without dead ends: 380 [2019-02-15 10:53:55,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 10:53:55,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-15 10:53:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-02-15 10:53:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-15 10:53:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-02-15 10:53:55,825 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-02-15 10:53:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:55,825 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-02-15 10:53:55,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 10:53:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-02-15 10:53:55,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-15 10:53:55,826 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:55,826 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-15 10:53:55,826 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:55,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:55,826 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-02-15 10:53:55,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:55,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:55,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:55,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:55,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:57,361 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-15 10:53:57,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:57,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:57,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:57,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:57,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:57,361 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-15 10:53:57,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:57,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:57,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:59,603 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-15 10:53:59,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:01,041 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-15 10:54:01,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:01,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-02-15 10:54:01,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:01,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-15 10:54:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-15 10:54:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 10:54:01,061 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-02-15 10:54:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:03,625 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-02-15 10:54:03,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 10:54:03,626 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-02-15 10:54:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:03,627 INFO L225 Difference]: With dead ends: 525 [2019-02-15 10:54:03,627 INFO L226 Difference]: Without dead ends: 250 [2019-02-15 10:54:03,628 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-15 10:54:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-15 10:54:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-02-15 10:54:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-15 10:54:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-02-15 10:54:03,696 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-02-15 10:54:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:03,696 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-02-15 10:54:03,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-15 10:54:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-02-15 10:54:03,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-02-15 10:54:03,697 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:03,697 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-15 10:54:03,698 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:03,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-02-15 10:54:03,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:03,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:03,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:03,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:03,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:06,746 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-15 10:54:06,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:06,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:06,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:06,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:06,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:06,746 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-15 10:54:06,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:06,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:06,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-15 10:54:06,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:06,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:14,322 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-15 10:54:14,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:21,525 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-15 10:54:21,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-02-15 10:54:21,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:21,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-02-15 10:54:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-02-15 10:54:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:54:21,546 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-02-15 10:54:49,045 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-15 10:54:49,695 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-15 10:54:50,456 WARN L181 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-15 10:54:51,081 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-15 10:54:51,671 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 10:54:52,241 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 10:54:52,788 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 10:54:53,315 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 10:54:53,840 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:54:54,342 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:54:54,831 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:54:55,316 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:54:55,843 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:54:56,317 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:54:56,745 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:54:57,161 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:54:57,575 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:54:58,701 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-15 10:55:02,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:02,059 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-02-15 10:55:02,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-02-15 10:55:02,060 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-02-15 10:55:02,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:02,061 INFO L225 Difference]: With dead ends: 667 [2019-02-15 10:55:02,061 INFO L226 Difference]: Without dead ends: 388 [2019-02-15 10:55:02,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 49.1s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-02-15 10:55:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-02-15 10:55:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-02-15 10:55:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-02-15 10:55:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-02-15 10:55:02,132 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-02-15 10:55:02,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:02,132 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-02-15 10:55:02,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-02-15 10:55:02,132 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-02-15 10:55:02,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-02-15 10:55:02,133 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:02,134 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-02-15 10:55:02,134 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:02,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-02-15 10:55:02,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:02,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:02,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:05,196 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-15 10:55:05,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:05,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:05,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:05,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:05,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:05,197 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-15 10:55:05,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:55:05,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:55:05,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:55:05,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:05,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:08,789 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-15 10:55:08,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:09,045 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-15 10:55:09,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:09,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-02-15 10:55:09,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:09,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-15 10:55:09,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-15 10:55:09,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-02-15 10:55:09,066 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-02-15 10:55:23,364 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-15 10:55:23,950 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-15 10:55:24,528 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-15 10:55:24,941 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-15 10:55:25,353 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-15 10:55:25,745 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 10:55:26,135 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 10:55:26,587 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 10:55:26,951 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 10:55:27,313 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:55:27,657 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:55:27,982 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:55:28,301 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:55:28,610 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:55:28,918 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:55:29,203 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:55:29,485 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:55:29,760 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:55:31,704 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-02-15 10:55:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:33,017 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-02-15 10:55:33,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-02-15 10:55:33,017 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-02-15 10:55:33,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:33,018 INFO L225 Difference]: With dead ends: 544 [2019-02-15 10:55:33,018 INFO L226 Difference]: Without dead ends: 402 [2019-02-15 10:55:33,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-02-15 10:55:33,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-15 10:55:33,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-02-15 10:55:33,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-15 10:55:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-02-15 10:55:33,082 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-02-15 10:55:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:33,082 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-02-15 10:55:33,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-15 10:55:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-02-15 10:55:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-15 10:55:33,083 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:33,083 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-15 10:55:33,083 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:33,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-02-15 10:55:33,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:33,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:33,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:33,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:34,782 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-15 10:55:34,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:34,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:34,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:34,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:34,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:34,783 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-15 10:55:34,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:34,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:34,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:37,265 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-15 10:55:37,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:38,932 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-15 10:55:38,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:38,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-02-15 10:55:38,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:38,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-15 10:55:38,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-15 10:55:38,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-02-15 10:55:38,952 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-02-15 10:55:41,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:41,947 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-02-15 10:55:41,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-15 10:55:41,948 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-02-15 10:55:41,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:41,950 INFO L225 Difference]: With dead ends: 555 [2019-02-15 10:55:41,950 INFO L226 Difference]: Without dead ends: 264 [2019-02-15 10:55:41,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-02-15 10:55:41,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-15 10:55:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-02-15 10:55:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-15 10:55:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-02-15 10:55:42,012 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-02-15 10:55:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:42,012 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-02-15 10:55:42,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-15 10:55:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-02-15 10:55:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-15 10:55:42,013 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:42,013 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-15 10:55:42,014 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:42,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-02-15 10:55:42,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:42,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:42,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:42,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:45,221 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-15 10:55:45,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:45,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:45,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:45,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:45,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:45,222 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-15 10:55:45,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:55:45,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:55:45,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-15 10:55:45,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:45,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:53,759 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-15 10:55:53,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:01,384 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-15 10:56:01,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:01,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-02-15 10:56:01,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:01,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-15 10:56:01,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-15 10:56:01,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 10:56:01,406 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-02-15 10:56:32,696 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-15 10:56:33,495 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-15 10:56:34,291 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-15 10:56:34,966 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-15 10:56:35,615 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-15 10:56:36,223 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-15 10:56:36,824 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 10:56:37,398 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 10:56:38,049 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 10:56:38,617 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 10:56:39,159 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:56:39,688 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:56:40,210 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:56:40,710 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:56:41,213 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:56:41,691 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:56:42,142 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:56:42,583 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:56:43,048 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:56:43,508 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:56:47,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:47,653 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-02-15 10:56:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-02-15 10:56:47,653 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-02-15 10:56:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:47,655 INFO L225 Difference]: With dead ends: 705 [2019-02-15 10:56:47,655 INFO L226 Difference]: Without dead ends: 410 [2019-02-15 10:56:47,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 54.6s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-02-15 10:56:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-15 10:56:47,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-02-15 10:56:47,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-15 10:56:47,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-02-15 10:56:47,738 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-02-15 10:56:47,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:47,738 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-02-15 10:56:47,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-15 10:56:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-02-15 10:56:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-15 10:56:47,739 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:47,740 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-02-15 10:56:47,740 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:47,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:47,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-02-15 10:56:47,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:47,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:47,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:51,150 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-15 10:56:51,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:51,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:51,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:51,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:51,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:51,151 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-15 10:56:51,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:56:51,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:56:51,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:56:51,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:51,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:54,941 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-15 10:56:54,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:55,217 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-15 10:56:55,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:55,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-02-15 10:56:55,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:55,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-15 10:56:55,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-15 10:56:55,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 10:56:55,237 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-02-15 10:57:11,529 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-15 10:57:12,162 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-15 10:57:12,771 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-15 10:57:13,205 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-02-15 10:57:13,638 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-15 10:57:14,134 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-15 10:57:14,549 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-15 10:57:14,969 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-15 10:57:15,348 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-15 10:57:15,729 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-15 10:57:16,105 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-15 10:57:16,466 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-15 10:57:16,829 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-15 10:57:17,180 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-15 10:57:17,522 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-15 10:57:17,850 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-15 10:57:18,170 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-15 10:57:18,480 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-15 10:57:18,791 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-15 10:57:19,149 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-15 10:57:19,451 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-15 10:57:22,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:22,538 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-02-15 10:57:22,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-02-15 10:57:22,539 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-02-15 10:57:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:22,540 INFO L225 Difference]: With dead ends: 574 [2019-02-15 10:57:22,540 INFO L226 Difference]: Without dead ends: 424 [2019-02-15 10:57:22,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-02-15 10:57:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-15 10:57:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-02-15 10:57:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-15 10:57:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-02-15 10:57:22,631 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-02-15 10:57:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:22,631 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-02-15 10:57:22,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-15 10:57:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-02-15 10:57:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-15 10:57:22,632 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:22,632 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-15 10:57:22,633 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:22,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-02-15 10:57:22,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:22,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:22,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:22,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:22,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:24,885 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-15 10:57:24,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:24,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:24,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:24,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:24,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:24,886 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-15 10:57:24,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:24,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:24,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:27,322 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-15 10:57:27,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:29,177 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-15 10:57:29,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:29,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-02-15 10:57:29,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:29,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-15 10:57:29,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-15 10:57:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 10:57:29,197 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-02-15 10:57:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:32,470 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-02-15 10:57:32,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-15 10:57:32,470 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-02-15 10:57:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:32,472 INFO L225 Difference]: With dead ends: 585 [2019-02-15 10:57:32,472 INFO L226 Difference]: Without dead ends: 278 [2019-02-15 10:57:32,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 10:57:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-15 10:57:32,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-02-15 10:57:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-15 10:57:32,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-02-15 10:57:32,551 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-02-15 10:57:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:32,551 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-02-15 10:57:32,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-15 10:57:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-02-15 10:57:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-15 10:57:32,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:32,552 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-15 10:57:32,552 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-02-15 10:57:32,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:32,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:32,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:32,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:32,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:36,120 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-15 10:57:36,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:36,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:36,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:36,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:36,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:36,120 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-15 10:57:36,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:36,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:36,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-15 10:57:36,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:36,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:45,575 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-15 10:57:45,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2850 proven. 2338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:54,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:54,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 203 [2019-02-15 10:57:54,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:54,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-02-15 10:57:54,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-02-15 10:57:54,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=37018, Unknown=0, NotChecked=0, Total=41412 [2019-02-15 10:57:54,063 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states.