java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:25:47,861 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:25:47,863 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:25:47,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:25:47,877 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:25:47,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:25:47,881 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:25:47,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:25:47,885 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:25:47,886 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:25:47,887 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:25:47,887 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:25:47,888 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:25:47,889 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:25:47,891 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:25:47,892 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:25:47,893 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:25:47,894 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:25:47,897 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:25:47,899 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:25:47,900 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:25:47,901 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:25:47,904 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:25:47,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:25:47,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:25:47,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:25:47,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:25:47,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:25:47,915 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:25:47,917 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:25:47,918 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:25:47,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:25:47,919 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:25:47,919 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:25:47,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:25:47,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:25:47,922 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-18 09:25:47,942 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:25:47,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:25:47,943 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:25:47,944 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:25:47,944 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:25:47,944 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:25:47,944 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:25:47,944 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:25:47,945 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-18 09:25:47,945 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:25:47,945 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-18 09:25:47,945 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-18 09:25:47,945 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:25:47,946 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:25:47,946 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:25:47,947 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:25:47,947 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:25:47,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:25:47,947 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:25:47,948 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:25:47,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:25:47,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:25:47,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:25:47,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:25:47,949 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:25:47,949 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:25:47,949 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:25:47,949 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:25:47,949 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:25:47,950 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:25:47,950 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:25:47,950 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:25:47,950 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:25:47,950 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:25:47,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:25:47,951 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:25:47,951 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:25:47,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:25:47,951 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:25:47,952 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:25:47,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:25:47,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:25:48,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:25:48,003 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:25:48,003 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:25:48,004 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-02-18 09:25:48,004 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-02-18 09:25:48,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:25:48,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:25:48,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:25:48,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:25:48,048 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:25:48,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:25:48,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:25:48,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:25:48,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:25:48,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/1) ... [2019-02-18 09:25:48,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:25:48,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:25:48,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:25:48,106 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:25:48,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:25:48,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:25:48,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:25:48,350 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:25:48,351 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-18 09:25:48,352 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:48 BoogieIcfgContainer [2019-02-18 09:25:48,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:25:48,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:25:48,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:25:48,356 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:25:48,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:25:48" (1/2) ... [2019-02-18 09:25:48,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146b8288 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:25:48, skipping insertion in model container [2019-02-18 09:25:48,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:25:48" (2/2) ... [2019-02-18 09:25:48,360 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-02-18 09:25:48,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:25:48,377 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:25:48,394 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:25:48,433 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:25:48,434 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:25:48,434 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:25:48,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:25:48,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:25:48,434 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:25:48,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:25:48,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:25:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-18 09:25:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 09:25:48,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:48,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 09:25:48,472 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-02-18 09:25:48,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:48,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:48,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:48,625 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-18 09:25:48,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:25:48,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:25:48,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:25:48,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:25:48,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:25:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:25:48,649 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-18 09:25:48,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:48,736 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-18 09:25:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:25:48,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-18 09:25:48,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:48,752 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:25:48,753 INFO L226 Difference]: Without dead ends: 7 [2019-02-18 09:25:48,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:25:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-18 09:25:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-18 09:25:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-18 09:25:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-18 09:25:48,790 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-02-18 09:25:48,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:48,791 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-18 09:25:48,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:25:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-18 09:25:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:25:48,792 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:48,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:25:48,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:48,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:48,793 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-02-18 09:25:48,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:48,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:48,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:25:48,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:48,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:48,907 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 09:25:48,914 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-02-18 09:25:48,995 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-18 09:25:48,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:25:49,164 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:25:49,166 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 09:25:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:49,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:25:49,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,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 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-18 09:25:49,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:49,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:49,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:25:49,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:25:49,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:49,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-18 09:25:49,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:49,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:25:49,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:25:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:25:49,501 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-02-18 09:25:49,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:49,547 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-02-18 09:25:49,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:25:49,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-18 09:25:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:49,549 INFO L225 Difference]: With dead ends: 13 [2019-02-18 09:25:49,550 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 09:25:49,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-18 09:25:49,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 09:25:49,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-18 09:25:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-18 09:25:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-02-18 09:25:49,555 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-02-18 09:25:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:49,556 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-02-18 09:25:49,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:25:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-02-18 09:25:49,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 09:25:49,556 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:49,556 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-02-18 09:25:49,557 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-02-18 09:25:49,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:49,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:49,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:25:49,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:49,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:49,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:49,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:49,648 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-18 09:25:49,664 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:49,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:49,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 09:25:49,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:49,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:25:49,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 09:25:49,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:49,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-18 09:25:49,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:49,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 09:25:49,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 09:25:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:25:49,936 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-02-18 09:25:50,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:50,077 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-02-18 09:25:50,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:25:50,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-18 09:25:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:50,079 INFO L225 Difference]: With dead ends: 16 [2019-02-18 09:25:50,079 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:25:50,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:25:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:25:50,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-18 09:25:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:25:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-02-18 09:25:50,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-02-18 09:25:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:50,083 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-02-18 09:25:50,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 09:25:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-02-18 09:25:50,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 09:25:50,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:50,084 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-02-18 09:25:50,085 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:50,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:50,085 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-02-18 09:25:50,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:50,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:50,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:50,201 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:25:50,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:50,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:50,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:50,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,204 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-18 09:25:50,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:50,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:50,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:50,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:50,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:25:50,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 09:25:50,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:50,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-18 09:25:50,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:50,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 09:25:50,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 09:25:50,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:25:50,452 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-02-18 09:25:50,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:50,512 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-18 09:25:50,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:25:50,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-02-18 09:25:50,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:50,513 INFO L225 Difference]: With dead ends: 19 [2019-02-18 09:25:50,513 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:25:50,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:25:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:25:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-18 09:25:50,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-18 09:25:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-02-18 09:25:50,518 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-02-18 09:25:50,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:50,518 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-02-18 09:25:50,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 09:25:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-02-18 09:25:50,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-18 09:25:50,519 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:50,519 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-02-18 09:25:50,519 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:50,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:50,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-02-18 09:25:50,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:50,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:25:50,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:50,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:50,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:50,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:50,616 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-18 09:25:50,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:50,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:50,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:50,657 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:25:50,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-02-18 09:25:50,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:50,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-18 09:25:50,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:50,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:25:50,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:25:50,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:25:50,816 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-02-18 09:25:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:50,945 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-02-18 09:25:50,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:25:50,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-02-18 09:25:50,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:50,947 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:25:50,947 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 09:25:50,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-18 09:25:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 09:25:50,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-18 09:25:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-18 09:25:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-02-18 09:25:50,958 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-02-18 09:25:50,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:50,958 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-02-18 09:25:50,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:25:50,958 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-02-18 09:25:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-18 09:25:50,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:50,960 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-02-18 09:25:50,961 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:50,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:50,961 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-02-18 09:25:50,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:50,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:50,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:50,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:25:51,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:51,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:51,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:51,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,259 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-18 09:25:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:51,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:51,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:25:51,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:51,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:25:51,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-02-18 09:25:51,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:51,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-18 09:25:51,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:51,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:25:51,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:25:51,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:25:51,462 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-02-18 09:25:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:51,512 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-02-18 09:25:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:25:51,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-02-18 09:25:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:51,513 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:25:51,513 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:25:51,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:25:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:25:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 09:25:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:25:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-02-18 09:25:51,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-02-18 09:25:51,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:51,518 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-02-18 09:25:51,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:25:51,518 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-02-18 09:25:51,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:25:51,519 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:51,519 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-02-18 09:25:51,519 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:51,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:51,520 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-02-18 09:25:51,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:51,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:51,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:51,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:51,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:51,642 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:25:51,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:51,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:51,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:51,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:51,643 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-18 09:25:51,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:51,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:51,686 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:51,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:51,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:25:51,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:51,966 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-02-18 09:25:51,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:51,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-18 09:25:51,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:51,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:25:51,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:25:51,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:25:51,986 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-02-18 09:25:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:52,088 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-02-18 09:25:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:25:52,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-02-18 09:25:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:52,089 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:25:52,089 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:25:52,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:25:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:25:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-18 09:25:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 09:25:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-02-18 09:25:52,093 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-02-18 09:25:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:52,094 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-02-18 09:25:52,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:25:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-02-18 09:25:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-18 09:25:52,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:52,095 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-02-18 09:25:52,095 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-02-18 09:25:52,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:52,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:52,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:25:52,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:52,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:52,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:52,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,255 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-18 09:25:52,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:52,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:52,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:25:52,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-02-18 09:25:52,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:52,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-18 09:25:52,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:52,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 09:25:52,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 09:25:52,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:25:52,481 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-02-18 09:25:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:52,525 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-02-18 09:25:52,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:25:52,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-02-18 09:25:52,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:52,528 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:25:52,529 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:25:52,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:25:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:25:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-18 09:25:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:25:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-02-18 09:25:52,533 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-02-18 09:25:52,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:52,533 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-02-18 09:25:52,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 09:25:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-02-18 09:25:52,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:25:52,534 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:52,534 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-02-18 09:25:52,535 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:52,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-02-18 09:25:52,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:52,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:52,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:25:52,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:52,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:52,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:52,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:52,679 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-18 09:25:52,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:52,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:52,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-18 09:25:52,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:52,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:25:52,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-02-18 09:25:52,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:52,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-18 09:25:52,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:52,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:25:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:25:52,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:25:52,940 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-02-18 09:25:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:53,184 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-02-18 09:25:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:25:53,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-18 09:25:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:53,185 INFO L225 Difference]: With dead ends: 34 [2019-02-18 09:25:53,185 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:25:53,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:25:53,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:25:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-18 09:25:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 09:25:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-02-18 09:25:53,195 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-02-18 09:25:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:53,196 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-02-18 09:25:53,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:25:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-02-18 09:25:53,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-18 09:25:53,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:53,197 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-02-18 09:25:53,197 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-02-18 09:25:53,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:53,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:53,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:53,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:53,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:25:53,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:53,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:53,404 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:53,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:53,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:53,405 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-18 09:25:53,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:53,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:53,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:53,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:53,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:25:53,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:54,118 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-02-18 09:25:54,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:54,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-18 09:25:54,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:54,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 09:25:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 09:25:54,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:25:54,138 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-02-18 09:25:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:54,203 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-02-18 09:25:54,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:25:54,211 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-02-18 09:25:54,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:54,212 INFO L225 Difference]: With dead ends: 37 [2019-02-18 09:25:54,212 INFO L226 Difference]: Without dead ends: 25 [2019-02-18 09:25:54,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:25:54,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-18 09:25:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-18 09:25:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-18 09:25:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-02-18 09:25:54,219 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-02-18 09:25:54,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:54,220 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-02-18 09:25:54,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 09:25:54,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-02-18 09:25:54,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-18 09:25:54,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:54,221 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-02-18 09:25:54,221 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:54,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:54,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-02-18 09:25:54,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:54,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:54,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:54,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:54,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:25:54,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:54,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:54,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:54,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:54,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:54,532 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-18 09:25:54,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:54,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:54,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:25:54,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-02-18 09:25:55,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:55,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-18 09:25:55,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:55,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:25:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:25:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:25:55,114 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-02-18 09:25:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:55,163 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-02-18 09:25:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:25:55,166 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-02-18 09:25:55,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:55,167 INFO L225 Difference]: With dead ends: 40 [2019-02-18 09:25:55,167 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:25:55,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-18 09:25:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:25:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-18 09:25:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-18 09:25:55,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-02-18 09:25:55,172 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-02-18 09:25:55,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:55,172 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-02-18 09:25:55,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:25:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-02-18 09:25:55,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-18 09:25:55,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:55,174 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-02-18 09:25:55,174 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:55,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:55,174 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-02-18 09:25:55,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:55,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:55,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:55,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:55,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:25:55,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:55,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:55,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:55,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:55,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:55,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:25:55,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:55,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:55,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-18 09:25:55,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:55,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:25:55,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:55,644 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-02-18 09:25:55,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:55,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-18 09:25:55,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:55,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:25:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:25:55,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:25:55,666 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-02-18 09:25:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:55,811 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-02-18 09:25:55,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:25:55,812 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-18 09:25:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:55,813 INFO L225 Difference]: With dead ends: 43 [2019-02-18 09:25:55,813 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:25:55,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:25:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:25:55,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-18 09:25:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-18 09:25:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-02-18 09:25:55,819 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-02-18 09:25:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:55,820 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-02-18 09:25:55,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:25:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-02-18 09:25:55,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-18 09:25:55,821 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:55,821 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-02-18 09:25:55,821 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:55,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-02-18 09:25:55,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:55,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:55,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:55,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:55,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:25:55,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:55,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:55,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:55,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:55,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:55,993 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-18 09:25:56,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:56,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:56,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:56,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:56,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:25:56,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:56,310 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-02-18 09:25:56,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:56,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-18 09:25:56,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:56,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-18 09:25:56,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-18 09:25:56,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:25:56,332 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-02-18 09:25:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:56,468 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-02-18 09:25:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:25:56,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-02-18 09:25:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:56,469 INFO L225 Difference]: With dead ends: 46 [2019-02-18 09:25:56,470 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:25:56,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:25:56,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:25:56,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-18 09:25:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:25:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-02-18 09:25:56,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-02-18 09:25:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:56,476 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-02-18 09:25:56,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-18 09:25:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-02-18 09:25:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-18 09:25:56,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:56,476 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-02-18 09:25:56,477 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-02-18 09:25:56,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:56,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:56,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:56,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:25:56,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:56,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:56,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:56,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:56,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:56,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:25:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:56,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:56,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:25:56,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-02-18 09:25:57,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:57,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-18 09:25:57,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:57,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-18 09:25:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-18 09:25:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:25:57,125 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-02-18 09:25:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:57,307 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-02-18 09:25:57,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:25:57,307 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-02-18 09:25:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:57,308 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:25:57,308 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:25:57,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:25:57,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:25:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-18 09:25:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 09:25:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-02-18 09:25:57,315 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-02-18 09:25:57,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:57,315 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-02-18 09:25:57,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-18 09:25:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-02-18 09:25:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-18 09:25:57,316 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:57,316 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-02-18 09:25:57,317 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:57,317 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-02-18 09:25:57,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:57,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:57,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:57,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:57,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:25:57,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:57,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:57,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:57,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:57,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:57,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:25:57,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:25:57,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:25:57,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-18 09:25:57,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:57,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:25:57,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-02-18 09:25:57,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:57,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-18 09:25:57,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:57,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:25:57,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:25:57,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:25:57,975 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-02-18 09:25:58,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:58,030 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-02-18 09:25:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:25:58,032 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-02-18 09:25:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:58,032 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:25:58,033 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:25:58,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:25:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:25:58,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-18 09:25:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:25:58,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-02-18 09:25:58,038 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-02-18 09:25:58,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:58,038 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-02-18 09:25:58,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:25:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-02-18 09:25:58,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-18 09:25:58,039 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:58,039 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-02-18 09:25:58,040 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:58,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:58,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-02-18 09:25:58,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:58,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:58,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:58,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:58,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:58,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:25:58,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:58,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:58,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:58,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:58,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:58,432 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-18 09:25:58,444 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:25:58,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:25:58,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:25:58,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:25:58,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:25:58,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:25:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-02-18 09:25:58,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:25:58,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-18 09:25:58,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:25:58,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-18 09:25:58,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-18 09:25:58,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:25:58,899 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-02-18 09:25:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:25:59,050 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-02-18 09:25:59,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:25:59,050 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-02-18 09:25:59,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:25:59,051 INFO L225 Difference]: With dead ends: 55 [2019-02-18 09:25:59,051 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:25:59,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:25:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:25:59,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-18 09:25:59,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 09:25:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-02-18 09:25:59,056 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-02-18 09:25:59,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:25:59,056 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-02-18 09:25:59,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-18 09:25:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-02-18 09:25:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-18 09:25:59,057 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:25:59,057 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-02-18 09:25:59,057 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:25:59,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:25:59,058 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-02-18 09:25:59,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:25:59,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:59,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:25:59,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:25:59,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:25:59,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:25:59,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:59,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:25:59,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:25:59,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:25:59,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:25:59,891 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-18 09:25:59,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:25:59,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:25:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:25:59,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:25:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:25:59,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:00,559 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-02-18 09:26:00,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:00,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-18 09:26:00,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:00,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-18 09:26:00,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-18 09:26:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:26:00,579 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-02-18 09:26:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:00,638 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-02-18 09:26:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:26:00,638 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-02-18 09:26:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:00,639 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:26:00,639 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:26:00,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-18 09:26:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:26:00,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-18 09:26:00,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 09:26:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-02-18 09:26:00,647 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-02-18 09:26:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:00,647 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-02-18 09:26:00,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-18 09:26:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-02-18 09:26:00,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-18 09:26:00,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:00,648 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-02-18 09:26:00,649 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:00,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:00,649 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-02-18 09:26:00,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:00,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:00,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:00,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:00,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:26:00,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:00,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:00,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:00,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:00,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:00,904 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-18 09:26:00,913 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:00,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:00,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-18 09:26:00,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:00,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:26:00,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:01,670 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-02-18 09:26:01,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:01,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-18 09:26:01,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:01,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-18 09:26:01,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-18 09:26:01,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:01,693 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-02-18 09:26:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:01,776 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-02-18 09:26:01,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:26:01,777 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-02-18 09:26:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:01,777 INFO L225 Difference]: With dead ends: 61 [2019-02-18 09:26:01,778 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:26:01,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:26:01,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:26:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-18 09:26:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 09:26:01,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-02-18 09:26:01,784 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-02-18 09:26:01,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:01,784 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-02-18 09:26:01,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-18 09:26:01,785 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-02-18 09:26:01,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-18 09:26:01,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:01,786 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-02-18 09:26:01,786 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:01,786 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-02-18 09:26:01,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:01,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:01,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:01,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:01,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:26:02,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:02,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:02,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:02,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:02,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:02,309 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-18 09:26:02,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:02,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:02,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:02,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:02,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:02,391 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:26:02,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-02-18 09:26:02,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:02,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-18 09:26:02,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:02,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-18 09:26:02,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-18 09:26:02,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:26:02,929 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-02-18 09:26:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:03,101 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-02-18 09:26:03,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:26:03,101 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-02-18 09:26:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:03,102 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:26:03,102 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:26:03,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:26:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:26:03,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-18 09:26:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-18 09:26:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-02-18 09:26:03,107 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-02-18 09:26:03,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:03,107 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-02-18 09:26:03,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-18 09:26:03,107 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-02-18 09:26:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-18 09:26:03,108 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:03,108 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-02-18 09:26:03,108 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:03,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:03,109 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-02-18 09:26:03,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:03,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:03,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:03,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:26:03,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:03,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:03,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:03,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:03,428 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-18 09:26:03,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:03,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:03,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:03,473 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:26:03,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-02-18 09:26:03,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:03,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-18 09:26:03,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:03,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-18 09:26:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-18 09:26:03,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:26:03,936 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-02-18 09:26:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:04,055 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-02-18 09:26:04,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:26:04,055 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-02-18 09:26:04,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:04,056 INFO L225 Difference]: With dead ends: 67 [2019-02-18 09:26:04,056 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:26:04,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:26:04,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:26:04,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-18 09:26:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:26:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-02-18 09:26:04,061 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-02-18 09:26:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:04,061 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-02-18 09:26:04,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-18 09:26:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-02-18 09:26:04,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:26:04,062 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:04,062 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-02-18 09:26:04,062 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:04,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:04,063 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-02-18 09:26:04,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:04,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:04,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:04,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:26:04,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:04,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:04,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:04,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:04,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:04,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 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-18 09:26:04,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:04,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:04,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-18 09:26:04,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:04,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:26:04,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-02-18 09:26:05,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:05,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-18 09:26:05,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:05,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:26:05,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:26:05,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:26:05,587 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-02-18 09:26:05,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:05,663 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-02-18 09:26:05,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:26:05,664 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-18 09:26:05,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:05,664 INFO L225 Difference]: With dead ends: 70 [2019-02-18 09:26:05,665 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:26:05,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:26:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:26:05,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-18 09:26:05,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 09:26:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-02-18 09:26:05,670 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-02-18 09:26:05,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:05,670 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-02-18 09:26:05,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:26:05,670 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-02-18 09:26:05,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-18 09:26:05,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:05,671 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-02-18 09:26:05,672 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:05,672 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-02-18 09:26:05,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:05,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:05,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:05,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:06,464 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:26:06,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:06,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:06,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:06,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:06,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:06,465 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-18 09:26:06,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:06,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:06,508 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:06,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:06,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:26:06,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-02-18 09:26:07,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:07,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-18 09:26:07,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:07,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-18 09:26:07,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-18 09:26:07,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:26:07,194 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-02-18 09:26:07,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:07,312 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-02-18 09:26:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:26:07,314 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-02-18 09:26:07,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:07,315 INFO L225 Difference]: With dead ends: 73 [2019-02-18 09:26:07,315 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:26:07,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:26:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:26:07,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-18 09:26:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:26:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-02-18 09:26:07,321 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-02-18 09:26:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:07,322 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-02-18 09:26:07,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-18 09:26:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-02-18 09:26:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:26:07,323 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:07,323 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-02-18 09:26:07,323 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-02-18 09:26:07,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:07,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:07,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:07,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:07,672 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:26:07,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:07,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:07,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:07,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:07,673 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-18 09:26:07,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:07,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:07,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:26:07,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-02-18 09:26:08,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:08,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-18 09:26:08,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:08,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-18 09:26:08,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-18 09:26:08,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:26:08,333 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-02-18 09:26:08,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:08,469 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-02-18 09:26:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:26:08,472 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-02-18 09:26:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:08,472 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:26:08,473 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:26:08,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-18 09:26:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:26:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-18 09:26:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 09:26:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-02-18 09:26:08,477 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-02-18 09:26:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:08,478 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-02-18 09:26:08,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-18 09:26:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-02-18 09:26:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-18 09:26:08,478 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:08,478 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-02-18 09:26:08,479 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:08,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:08,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-02-18 09:26:08,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:08,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:08,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:09,035 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:26:09,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:09,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:09,036 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:09,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:09,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:09,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:26:09,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:09,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:09,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-18 09:26:09,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:09,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:09,144 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:26:09,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:10,009 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-02-18 09:26:10,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:10,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-18 09:26:10,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:10,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:26:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:26:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:26:10,029 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-02-18 09:26:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:10,122 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-02-18 09:26:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:26:10,123 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-02-18 09:26:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:10,124 INFO L225 Difference]: With dead ends: 79 [2019-02-18 09:26:10,124 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:26:10,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:26:10,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:26:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-18 09:26:10,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-18 09:26:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-02-18 09:26:10,128 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-02-18 09:26:10,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:10,128 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-02-18 09:26:10,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:26:10,129 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-02-18 09:26:10,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-18 09:26:10,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:10,129 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-02-18 09:26:10,129 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:10,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-02-18 09:26:10,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:10,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:10,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:26:10,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:10,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:10,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:10,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:10,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:10,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:26:10,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:10,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:10,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:10,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:10,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:26:10,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-02-18 09:26:11,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:11,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-18 09:26:11,397 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:11,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:26:11,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:26:11,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:26:11,399 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-02-18 09:26:11,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:11,507 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-02-18 09:26:11,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:26:11,508 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-02-18 09:26:11,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:11,509 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:26:11,509 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:26:11,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:26:11,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:26:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-18 09:26:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 09:26:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-02-18 09:26:11,513 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-02-18 09:26:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:11,513 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-02-18 09:26:11,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:26:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-02-18 09:26:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-18 09:26:11,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:11,514 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-02-18 09:26:11,514 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-02-18 09:26:11,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:11,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:11,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:26:12,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:12,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:12,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:12,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:12,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:12,262 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-18 09:26:12,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:12,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:12,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:12,333 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:26:12,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-02-18 09:26:13,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:13,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-18 09:26:13,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:13,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-18 09:26:13,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-18 09:26:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:26:13,536 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-02-18 09:26:13,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:13,625 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-02-18 09:26:13,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:26:13,626 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-02-18 09:26:13,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:13,626 INFO L225 Difference]: With dead ends: 85 [2019-02-18 09:26:13,627 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:26:13,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-18 09:26:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:26:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-18 09:26:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-18 09:26:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-02-18 09:26:13,631 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-02-18 09:26:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:13,631 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-02-18 09:26:13,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-18 09:26:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-02-18 09:26:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-18 09:26:13,632 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:13,632 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-02-18 09:26:13,632 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:13,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-02-18 09:26:13,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:13,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:13,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:13,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:13,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:26:14,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:14,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:14,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:14,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:14,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:14,248 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-18 09:26:14,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:14,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:14,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-18 09:26:14,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:14,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:26:14,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-02-18 09:26:15,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:15,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-18 09:26:15,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:15,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:26:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:26:15,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:26:15,289 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-02-18 09:26:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:15,384 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-02-18 09:26:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:26:15,384 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-02-18 09:26:15,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:15,385 INFO L225 Difference]: With dead ends: 88 [2019-02-18 09:26:15,385 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:26:15,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-18 09:26:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:26:15,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-18 09:26:15,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:26:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-02-18 09:26:15,390 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-02-18 09:26:15,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:15,390 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-02-18 09:26:15,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:26:15,390 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-02-18 09:26:15,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-18 09:26:15,391 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:15,391 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-02-18 09:26:15,391 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:15,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:15,392 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-02-18 09:26:15,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:15,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:15,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:15,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:26:15,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:15,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:15,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:15,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:15,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:15,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 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-18 09:26:15,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:15,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:15,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:15,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:15,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:26:15,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-02-18 09:26:16,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:16,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-18 09:26:16,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:16,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-18 09:26:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-18 09:26:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:26:16,896 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-02-18 09:26:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:17,019 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-02-18 09:26:17,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:26:17,020 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-02-18 09:26:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:17,020 INFO L225 Difference]: With dead ends: 91 [2019-02-18 09:26:17,021 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:26:17,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:26:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:26:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-18 09:26:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 09:26:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-02-18 09:26:17,025 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-02-18 09:26:17,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:17,025 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-02-18 09:26:17,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-18 09:26:17,026 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-02-18 09:26:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-18 09:26:17,026 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:17,026 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-02-18 09:26:17,026 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:17,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-02-18 09:26:17,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:17,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:17,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:17,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:17,028 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:26:17,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:17,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:17,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:17,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:17,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:17,490 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-18 09:26:17,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:17,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:17,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:26:17,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-02-18 09:26:18,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:18,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-18 09:26:18,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:18,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-18 09:26:18,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-18 09:26:18,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:26:18,864 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-02-18 09:26:18,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:18,982 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-02-18 09:26:18,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:26:18,982 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-02-18 09:26:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:18,983 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:26:18,984 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:26:18,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:26:18,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:26:18,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-18 09:26:18,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 09:26:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-02-18 09:26:18,988 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-02-18 09:26:18,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:18,988 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-02-18 09:26:18,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-18 09:26:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-02-18 09:26:18,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-18 09:26:18,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:18,989 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-02-18 09:26:18,989 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:18,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:18,989 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-02-18 09:26:18,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:18,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:18,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:18,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:26:19,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:19,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:19,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:19,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:19,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:19,744 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-18 09:26:19,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:19,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:19,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-18 09:26:19,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:19,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:26:19,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-02-18 09:26:20,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:20,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-18 09:26:20,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:20,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:26:20,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:26:20,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:26:20,935 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-02-18 09:26:21,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:21,039 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-02-18 09:26:21,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:26:21,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-02-18 09:26:21,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:21,040 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:26:21,040 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:26:21,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:26:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:26:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-18 09:26:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-18 09:26:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-02-18 09:26:21,044 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-02-18 09:26:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:21,044 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-02-18 09:26:21,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:26:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-02-18 09:26:21,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-18 09:26:21,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:21,045 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-02-18 09:26:21,045 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-02-18 09:26:21,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:21,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:21,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:26:22,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:22,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:22,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:22,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:22,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:22,084 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-18 09:26:22,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:22,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:22,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:22,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:22,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:22,153 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:26:22,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-02-18 09:26:23,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:23,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-18 09:26:23,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:23,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-18 09:26:23,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-18 09:26:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:26:23,197 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-02-18 09:26:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:23,371 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-02-18 09:26:23,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:26:23,372 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-02-18 09:26:23,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:23,373 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:26:23,373 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:26:23,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:26:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:26:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-18 09:26:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-18 09:26:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-02-18 09:26:23,375 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-02-18 09:26:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:23,376 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-02-18 09:26:23,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-18 09:26:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-02-18 09:26:23,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-18 09:26:23,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:23,376 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-02-18 09:26:23,376 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:23,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:23,377 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-02-18 09:26:23,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:23,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:23,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:23,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:23,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:26:23,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:23,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:23,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:23,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:23,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:23,993 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-18 09:26:24,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:24,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:24,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:26:24,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:25,375 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-02-18 09:26:25,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:25,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-18 09:26:25,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:25,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-18 09:26:25,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-18 09:26:25,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:26:25,396 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-02-18 09:26:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:25,549 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-02-18 09:26:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:26:25,550 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-02-18 09:26:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:25,551 INFO L225 Difference]: With dead ends: 103 [2019-02-18 09:26:25,551 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:26:25,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:26:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:26:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-18 09:26:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-18 09:26:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-02-18 09:26:25,556 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-02-18 09:26:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:25,556 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-02-18 09:26:25,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-18 09:26:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-02-18 09:26:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-18 09:26:25,557 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:25,557 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-02-18 09:26:25,557 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:25,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:25,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-02-18 09:26:25,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:25,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:25,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:25,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:25,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:26:26,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:26,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:26,070 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:26,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:26,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:26,070 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-18 09:26:26,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:26,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:26,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-18 09:26:26,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:26,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:26,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:26:26,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:27,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-02-18 09:26:27,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:27,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-18 09:26:27,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:27,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-18 09:26:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-18 09:26:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:26:27,543 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-02-18 09:26:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:27,688 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-02-18 09:26:27,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:26:27,688 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-02-18 09:26:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:27,689 INFO L225 Difference]: With dead ends: 106 [2019-02-18 09:26:27,689 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:26:27,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-18 09:26:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:26:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-18 09:26:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-18 09:26:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-02-18 09:26:27,693 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-02-18 09:26:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:27,694 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-02-18 09:26:27,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-18 09:26:27,694 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-02-18 09:26:27,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-18 09:26:27,694 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:27,694 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-02-18 09:26:27,695 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:27,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:27,695 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-02-18 09:26:27,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:27,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:27,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:27,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:26:28,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:28,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:28,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:28,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:28,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:28,261 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-18 09:26:28,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:28,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:28,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:28,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:28,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:26:28,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:29,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-02-18 09:26:29,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:29,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-18 09:26:29,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:29,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-18 09:26:29,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-18 09:26:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:26:29,754 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-02-18 09:26:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:29,980 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-02-18 09:26:29,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:26:29,980 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-02-18 09:26:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:29,981 INFO L225 Difference]: With dead ends: 109 [2019-02-18 09:26:29,981 INFO L226 Difference]: Without dead ends: 73 [2019-02-18 09:26:29,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:26:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-18 09:26:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-18 09:26:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:26:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-02-18 09:26:29,984 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-02-18 09:26:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:29,984 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-02-18 09:26:29,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-18 09:26:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-02-18 09:26:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:26:29,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:29,985 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-02-18 09:26:29,986 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-02-18 09:26:29,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:29,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:29,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:26:30,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:30,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:30,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:30,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:30,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:30,747 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-18 09:26:30,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:30,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:30,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:26:30,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-02-18 09:26:32,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:32,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-18 09:26:32,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:32,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-18 09:26:32,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-18 09:26:32,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:26:32,140 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-02-18 09:26:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:32,385 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-02-18 09:26:32,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:26:32,385 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-02-18 09:26:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:32,386 INFO L225 Difference]: With dead ends: 112 [2019-02-18 09:26:32,386 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:26:32,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-18 09:26:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:26:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-18 09:26:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 09:26:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-02-18 09:26:32,391 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-02-18 09:26:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:32,391 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-02-18 09:26:32,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-18 09:26:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-02-18 09:26:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-18 09:26:32,392 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:32,392 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-02-18 09:26:32,392 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-02-18 09:26:32,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:32,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:32,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:32,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:32,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:32,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:26:32,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:32,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:32,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:32,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:32,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:32,974 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-18 09:26:32,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:32,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:33,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-18 09:26:33,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:33,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:26:33,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-02-18 09:26:34,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:34,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-18 09:26:34,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:34,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:26:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:26:34,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:26:34,697 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-02-18 09:26:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:34,914 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-02-18 09:26:34,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:26:34,914 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-02-18 09:26:34,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:34,915 INFO L225 Difference]: With dead ends: 115 [2019-02-18 09:26:34,915 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:26:34,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:26:34,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:26:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-18 09:26:34,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-18 09:26:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-02-18 09:26:34,918 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-02-18 09:26:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:34,918 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-02-18 09:26:34,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:26:34,918 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-02-18 09:26:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-18 09:26:34,919 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:34,919 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-02-18 09:26:34,919 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:34,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:34,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-02-18 09:26:34,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:34,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:34,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:34,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:26:35,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:35,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:35,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:35,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:35,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:35,756 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-18 09:26:35,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:35,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:35,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:35,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:35,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:26:35,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-02-18 09:26:37,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:37,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-18 09:26:37,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:37,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-18 09:26:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-18 09:26:37,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:26:37,329 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-02-18 09:26:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:37,472 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-02-18 09:26:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:26:37,472 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-02-18 09:26:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:37,473 INFO L225 Difference]: With dead ends: 118 [2019-02-18 09:26:37,473 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:26:37,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:26:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:26:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-18 09:26:37,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-18 09:26:37,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-02-18 09:26:37,476 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-02-18 09:26:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:37,476 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-02-18 09:26:37,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-18 09:26:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-02-18 09:26:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-18 09:26:37,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:37,477 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-02-18 09:26:37,477 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:37,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-02-18 09:26:37,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:37,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:37,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:26:38,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:38,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:38,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:38,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:38,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:38,154 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-18 09:26:38,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:38,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:38,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:26:38,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-02-18 09:26:40,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:40,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-18 09:26:40,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:40,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-18 09:26:40,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-18 09:26:40,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:26:40,262 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-02-18 09:26:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:40,412 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-02-18 09:26:40,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:26:40,413 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-02-18 09:26:40,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:40,413 INFO L225 Difference]: With dead ends: 121 [2019-02-18 09:26:40,413 INFO L226 Difference]: Without dead ends: 81 [2019-02-18 09:26:40,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:26:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-18 09:26:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-18 09:26:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-18 09:26:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-02-18 09:26:40,418 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-02-18 09:26:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:40,418 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-02-18 09:26:40,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-18 09:26:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-02-18 09:26:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-18 09:26:40,418 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:40,419 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-02-18 09:26:40,419 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:40,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:40,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-02-18 09:26:40,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:40,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:40,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:40,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:40,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:41,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:26:41,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:41,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:41,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:41,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:41,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:41,085 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-18 09:26:41,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:41,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:41,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-18 09:26:41,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:41,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:26:41,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-02-18 09:26:43,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:43,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-18 09:26:43,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:43,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-18 09:26:43,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-18 09:26:43,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:26:43,307 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-02-18 09:26:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:43,450 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-02-18 09:26:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:26:43,451 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-02-18 09:26:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:43,452 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:26:43,452 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:26:43,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:26:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:26:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-18 09:26:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-18 09:26:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-02-18 09:26:43,454 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-02-18 09:26:43,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:43,455 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-02-18 09:26:43,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-18 09:26:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-02-18 09:26:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-18 09:26:43,455 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:43,455 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-02-18 09:26:43,455 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-02-18 09:26:43,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:43,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:43,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:43,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:43,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:26:44,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:44,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:44,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:44,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:44,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:44,182 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-18 09:26:44,189 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:44,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:44,256 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:44,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:44,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:26:44,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-02-18 09:26:46,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:46,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-18 09:26:46,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:46,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-18 09:26:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-18 09:26:46,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:26:46,215 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-02-18 09:26:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:46,358 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-02-18 09:26:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:26:46,358 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-02-18 09:26:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:46,359 INFO L225 Difference]: With dead ends: 127 [2019-02-18 09:26:46,359 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:26:46,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:26:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:26:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-18 09:26:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-18 09:26:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-02-18 09:26:46,363 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-02-18 09:26:46,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:46,363 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-02-18 09:26:46,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-18 09:26:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-02-18 09:26:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-18 09:26:46,364 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:46,364 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-02-18 09:26:46,364 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-02-18 09:26:46,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:46,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:46,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:46,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:46,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:47,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:26:47,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:47,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:47,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:47,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:47,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:47,987 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-18 09:26:47,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:47,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:48,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:26:48,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-02-18 09:26:49,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:49,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-18 09:26:49,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:49,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-18 09:26:49,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-18 09:26:49,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:26:49,931 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-02-18 09:26:50,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:50,133 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-02-18 09:26:50,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:26:50,134 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-02-18 09:26:50,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:50,134 INFO L225 Difference]: With dead ends: 130 [2019-02-18 09:26:50,134 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:26:50,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-18 09:26:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:26:50,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-18 09:26:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-18 09:26:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-02-18 09:26:50,137 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-02-18 09:26:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:50,138 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-02-18 09:26:50,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-18 09:26:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-02-18 09:26:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-18 09:26:50,139 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:50,139 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-02-18 09:26:50,139 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:50,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-02-18 09:26:50,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:50,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:50,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:50,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:50,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:26:51,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:51,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:51,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:51,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:51,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:51,425 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-18 09:26:51,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:26:51,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:26:51,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-18 09:26:51,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:51,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:51,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:26:51,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:53,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-02-18 09:26:53,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:53,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-18 09:26:53,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:53,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:26:53,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:26:53,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:26:53,703 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-02-18 09:26:53,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:53,870 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-02-18 09:26:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:26:53,871 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-02-18 09:26:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:53,872 INFO L225 Difference]: With dead ends: 133 [2019-02-18 09:26:53,872 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:26:53,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:26:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:26:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-18 09:26:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-18 09:26:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-02-18 09:26:53,875 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-02-18 09:26:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:53,875 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-02-18 09:26:53,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:26:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-02-18 09:26:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-18 09:26:53,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:53,876 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-02-18 09:26:53,876 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:53,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-02-18 09:26:53,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:53,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:53,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:53,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:53,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:26:55,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:55,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:55,919 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:55,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:55,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:55,920 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-18 09:26:55,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:26:55,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:26:55,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:26:55,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:26:55,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:26:56,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:26:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-02-18 09:26:58,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:26:58,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-18 09:26:58,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:26:58,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-18 09:26:58,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-18 09:26:58,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:26:58,390 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-02-18 09:26:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:26:58,558 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-02-18 09:26:58,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:26:58,558 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-02-18 09:26:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:26:58,559 INFO L225 Difference]: With dead ends: 136 [2019-02-18 09:26:58,559 INFO L226 Difference]: Without dead ends: 91 [2019-02-18 09:26:58,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:26:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-18 09:26:58,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-18 09:26:58,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-18 09:26:58,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-02-18 09:26:58,562 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-02-18 09:26:58,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:26:58,562 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-02-18 09:26:58,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-18 09:26:58,563 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-02-18 09:26:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-18 09:26:58,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:26:58,563 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-02-18 09:26:58,563 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:26:58,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:26:58,564 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-02-18 09:26:58,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:26:58,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:58,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:26:58,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:26:58,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:26:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:26:59,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:59,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:26:59,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:26:59,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:26:59,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:26:59,697 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-18 09:26:59,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:26:59,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:26:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:26:59,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:26:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:26:59,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-02-18 09:27:02,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:02,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-18 09:27:02,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:02,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-18 09:27:02,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-18 09:27:02,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:27:02,007 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-02-18 09:27:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:02,280 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-02-18 09:27:02,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:27:02,280 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-02-18 09:27:02,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:02,281 INFO L225 Difference]: With dead ends: 139 [2019-02-18 09:27:02,281 INFO L226 Difference]: Without dead ends: 93 [2019-02-18 09:27:02,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-18 09:27:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-18 09:27:02,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-18 09:27:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 09:27:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-02-18 09:27:02,287 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-02-18 09:27:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:02,287 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-02-18 09:27:02,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-18 09:27:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-02-18 09:27:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-18 09:27:02,288 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:02,288 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-02-18 09:27:02,288 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:02,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-02-18 09:27:02,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:02,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:02,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:02,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:02,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:27:03,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:03,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:03,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:03,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:03,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:03,245 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-18 09:27:03,253 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:03,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:03,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-18 09:27:03,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:03,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:27:03,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-02-18 09:27:05,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:05,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-18 09:27:05,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:05,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:27:05,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:27:05,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:27:05,976 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-02-18 09:27:07,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:07,310 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-02-18 09:27:07,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:27:07,311 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-02-18 09:27:07,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:07,311 INFO L225 Difference]: With dead ends: 142 [2019-02-18 09:27:07,311 INFO L226 Difference]: Without dead ends: 95 [2019-02-18 09:27:07,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:27:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-18 09:27:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-18 09:27:07,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-18 09:27:07,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-02-18 09:27:07,315 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-02-18 09:27:07,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:07,315 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-02-18 09:27:07,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:27:07,315 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-02-18 09:27:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-18 09:27:07,316 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:07,316 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-02-18 09:27:07,316 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:07,316 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-02-18 09:27:07,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:07,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:07,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:07,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:27:08,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:08,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:08,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:08,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:08,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:08,665 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-18 09:27:08,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:08,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:08,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:08,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:08,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:27:08,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-02-18 09:27:12,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:12,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-18 09:27:12,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:12,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-18 09:27:12,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-18 09:27:12,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:27:12,444 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-02-18 09:27:12,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:12,668 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-02-18 09:27:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:27:12,670 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-02-18 09:27:12,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:12,670 INFO L225 Difference]: With dead ends: 145 [2019-02-18 09:27:12,670 INFO L226 Difference]: Without dead ends: 97 [2019-02-18 09:27:12,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:27:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-18 09:27:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-18 09:27:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-18 09:27:12,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-02-18 09:27:12,674 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-02-18 09:27:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:12,674 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-02-18 09:27:12,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-18 09:27:12,675 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-02-18 09:27:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-18 09:27:12,675 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:12,675 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-02-18 09:27:12,675 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:12,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-02-18 09:27:12,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:12,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:12,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:12,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:12,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:27:14,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:14,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:14,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:14,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:14,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:14,286 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-18 09:27:14,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:14,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:14,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:14,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:27:14,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-02-18 09:27:16,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:16,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-18 09:27:16,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:16,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-18 09:27:16,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-18 09:27:16,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:27:16,953 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-02-18 09:27:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:17,292 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-02-18 09:27:17,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:27:17,293 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-02-18 09:27:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:17,294 INFO L225 Difference]: With dead ends: 148 [2019-02-18 09:27:17,294 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 09:27:17,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-18 09:27:17,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 09:27:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-18 09:27:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-18 09:27:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-02-18 09:27:17,298 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-02-18 09:27:17,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:17,299 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-02-18 09:27:17,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-18 09:27:17,299 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-02-18 09:27:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-18 09:27:17,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:17,300 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-02-18 09:27:17,300 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:17,300 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-02-18 09:27:17,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:17,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:27:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:18,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:18,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:18,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:18,362 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-18 09:27:18,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:18,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:18,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-18 09:27:18,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:18,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:27:18,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-02-18 09:27:21,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:21,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-18 09:27:21,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:21,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:27:21,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:27:21,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:27:21,726 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-02-18 09:27:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:21,907 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-02-18 09:27:21,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:27:21,907 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-02-18 09:27:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:21,908 INFO L225 Difference]: With dead ends: 151 [2019-02-18 09:27:21,908 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 09:27:21,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:27:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 09:27:21,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-18 09:27:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:27:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-02-18 09:27:21,911 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-02-18 09:27:21,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:21,911 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-02-18 09:27:21,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:27:21,912 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-02-18 09:27:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:27:21,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:21,912 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-02-18 09:27:21,913 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:21,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:21,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-02-18 09:27:21,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:21,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:21,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:21,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:21,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:27:22,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:22,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:22,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:22,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:22,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:22,850 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-18 09:27:22,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:22,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:22,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:22,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:22,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:27:22,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:25,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-02-18 09:27:25,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:25,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-18 09:27:25,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:25,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-18 09:27:25,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-18 09:27:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:27:25,439 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-02-18 09:27:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:25,689 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-02-18 09:27:25,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:27:25,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-02-18 09:27:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:25,697 INFO L225 Difference]: With dead ends: 154 [2019-02-18 09:27:25,697 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:27:25,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:27:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:27:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-18 09:27:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 09:27:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-02-18 09:27:25,701 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-02-18 09:27:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:25,701 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-02-18 09:27:25,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-18 09:27:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-02-18 09:27:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-18 09:27:25,702 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:25,702 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-02-18 09:27:25,702 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:25,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:25,702 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-02-18 09:27:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:25,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:25,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:25,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:25,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:27:26,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:26,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:26,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:26,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:26,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:26,989 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-18 09:27:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:26,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:27,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:27:27,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-02-18 09:27:29,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:29,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-18 09:27:29,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:29,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-18 09:27:29,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-18 09:27:29,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:27:29,767 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-02-18 09:27:29,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:29,990 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-02-18 09:27:29,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:27:29,990 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-02-18 09:27:29,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:29,991 INFO L225 Difference]: With dead ends: 157 [2019-02-18 09:27:29,991 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:27:29,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:27:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:27:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-18 09:27:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 09:27:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-02-18 09:27:29,995 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-02-18 09:27:29,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:29,995 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-02-18 09:27:29,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-18 09:27:29,995 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-02-18 09:27:29,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 09:27:29,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:29,996 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-02-18 09:27:29,996 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:29,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-02-18 09:27:29,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:29,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:29,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:29,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:27:31,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:31,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:31,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:31,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:31,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:31,942 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-18 09:27:31,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:31,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:33,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-18 09:27:33,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:33,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:33,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:27:33,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-02-18 09:27:36,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:36,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-18 09:27:36,166 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:36,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:27:36,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:27:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:27:36,168 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-02-18 09:27:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:36,877 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-02-18 09:27:36,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:27:36,877 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-02-18 09:27:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:36,878 INFO L225 Difference]: With dead ends: 160 [2019-02-18 09:27:36,878 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:27:36,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:27:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:27:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-18 09:27:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-18 09:27:36,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-02-18 09:27:36,882 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-02-18 09:27:36,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:36,882 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-02-18 09:27:36,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:27:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-02-18 09:27:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-18 09:27:36,883 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:36,883 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-02-18 09:27:36,883 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:36,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:36,884 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-02-18 09:27:36,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:36,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:36,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:36,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:36,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:36,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:27:37,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:37,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:37,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:37,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:37,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:37,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:27:37,965 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:37,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:38,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:38,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:38,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:27:38,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:40,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-02-18 09:27:40,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:40,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-18 09:27:40,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:40,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-18 09:27:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-18 09:27:40,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:27:40,843 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-02-18 09:27:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:41,169 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-02-18 09:27:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:27:41,169 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-02-18 09:27:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:41,170 INFO L225 Difference]: With dead ends: 163 [2019-02-18 09:27:41,170 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 09:27:41,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:27:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 09:27:41,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-18 09:27:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-18 09:27:41,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-02-18 09:27:41,174 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-02-18 09:27:41,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:41,175 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-02-18 09:27:41,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-18 09:27:41,175 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-02-18 09:27:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-18 09:27:41,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:41,176 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-02-18 09:27:41,176 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-02-18 09:27:41,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:41,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:41,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:27:42,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:42,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:42,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:42,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:42,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:42,785 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-18 09:27:42,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:42,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:42,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:27:42,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-02-18 09:27:45,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:45,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-18 09:27:45,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:45,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:27:45,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:27:45,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:27:45,774 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-02-18 09:27:46,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:46,007 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-02-18 09:27:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:27:46,008 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-02-18 09:27:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:46,008 INFO L225 Difference]: With dead ends: 166 [2019-02-18 09:27:46,008 INFO L226 Difference]: Without dead ends: 111 [2019-02-18 09:27:46,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-18 09:27:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-18 09:27:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-18 09:27:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-18 09:27:46,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-02-18 09:27:46,013 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-02-18 09:27:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:46,013 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-02-18 09:27:46,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:27:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-02-18 09:27:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-18 09:27:46,013 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:46,013 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-02-18 09:27:46,014 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-02-18 09:27:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:46,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:46,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:46,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-18 09:27:47,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:47,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:47,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:47,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:47,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:47,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-18 09:27:47,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:27:47,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:27:48,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-18 09:27:48,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:48,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-18 09:27:48,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-02-18 09:27:51,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:51,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-18 09:27:51,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:51,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-18 09:27:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-18 09:27:51,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:27:51,893 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-02-18 09:27:52,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:52,148 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-02-18 09:27:52,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 09:27:52,152 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-02-18 09:27:52,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:52,153 INFO L225 Difference]: With dead ends: 169 [2019-02-18 09:27:52,153 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:27:52,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-18 09:27:52,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:27:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-18 09:27:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-18 09:27:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-02-18 09:27:52,156 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-02-18 09:27:52,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:52,157 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-02-18 09:27:52,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-18 09:27:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-02-18 09:27:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-18 09:27:52,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:52,158 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-02-18 09:27:52,158 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:52,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:52,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-02-18 09:27:52,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:52,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:52,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:53,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-18 09:27:53,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:53,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:53,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:53,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:53,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:53,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 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-18 09:27:53,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:27:53,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:27:53,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:27:53,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:27:53,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-18 09:27:53,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:27:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-02-18 09:27:56,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:27:56,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-18 09:27:56,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:27:56,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-18 09:27:56,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-18 09:27:56,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:27:56,831 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-02-18 09:27:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:27:57,134 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-02-18 09:27:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 09:27:57,134 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-02-18 09:27:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:27:57,135 INFO L225 Difference]: With dead ends: 172 [2019-02-18 09:27:57,135 INFO L226 Difference]: Without dead ends: 115 [2019-02-18 09:27:57,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:27:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-18 09:27:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-18 09:27:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-18 09:27:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-02-18 09:27:57,139 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-02-18 09:27:57,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:27:57,139 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-02-18 09:27:57,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-18 09:27:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-02-18 09:27:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-18 09:27:57,140 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:27:57,140 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-02-18 09:27:57,141 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:27:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:27:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-02-18 09:27:57,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:27:57,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:57,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:27:57,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:27:57,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:27:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-18 09:27:58,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:58,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:27:58,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:27:58,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:27:58,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:27:58,364 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-18 09:27:58,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:27:58,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:27:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:27:58,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:27:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-18 09:27:58,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-02-18 09:28:02,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:02,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-18 09:28:02,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:02,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-18 09:28:02,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-18 09:28:02,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:28:02,394 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-02-18 09:28:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:02,799 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-02-18 09:28:02,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:28:02,799 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-02-18 09:28:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:02,800 INFO L225 Difference]: With dead ends: 175 [2019-02-18 09:28:02,800 INFO L226 Difference]: Without dead ends: 117 [2019-02-18 09:28:02,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:28:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-18 09:28:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-02-18 09:28:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-18 09:28:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-02-18 09:28:02,805 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-02-18 09:28:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:02,805 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-02-18 09:28:02,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-18 09:28:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-02-18 09:28:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-18 09:28:02,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:02,806 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-02-18 09:28:02,806 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:02,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-02-18 09:28:02,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:02,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:02,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:02,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-18 09:28:04,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:04,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:04,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:04,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:04,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:04,031 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-18 09:28:04,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:04,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:04,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-18 09:28:04,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:04,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-18 09:28:04,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-02-18 09:28:08,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:08,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-18 09:28:08,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:08,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:28:08,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:28:08,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:28:08,903 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-02-18 09:28:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:09,202 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-02-18 09:28:09,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 09:28:09,203 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-02-18 09:28:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:09,203 INFO L225 Difference]: With dead ends: 178 [2019-02-18 09:28:09,203 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 09:28:09,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-18 09:28:09,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 09:28:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-02-18 09:28:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-18 09:28:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-02-18 09:28:09,206 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-02-18 09:28:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:09,207 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-02-18 09:28:09,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:28:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-02-18 09:28:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-18 09:28:09,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:09,208 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-02-18 09:28:09,208 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:09,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-02-18 09:28:09,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:09,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:09,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:09,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:09,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:10,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-18 09:28:10,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:10,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:10,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:10,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:10,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:10,494 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-18 09:28:10,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:10,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:10,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:10,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:10,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:10,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-18 09:28:10,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-02-18 09:28:14,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:14,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-18 09:28:14,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:14,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-18 09:28:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-18 09:28:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:28:14,259 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-02-18 09:28:14,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:14,545 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-02-18 09:28:14,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 09:28:14,546 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-02-18 09:28:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:14,546 INFO L225 Difference]: With dead ends: 181 [2019-02-18 09:28:14,547 INFO L226 Difference]: Without dead ends: 121 [2019-02-18 09:28:14,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:28:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-18 09:28:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-02-18 09:28:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-18 09:28:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-02-18 09:28:14,550 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-02-18 09:28:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:14,550 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-02-18 09:28:14,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-18 09:28:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-02-18 09:28:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-18 09:28:14,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:14,552 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-02-18 09:28:14,552 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:14,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-02-18 09:28:14,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:14,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:14,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-18 09:28:15,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:15,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:15,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:15,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:15,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:15,847 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-18 09:28:15,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:15,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:15,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-18 09:28:15,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-02-18 09:28:19,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:19,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-18 09:28:19,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:19,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-18 09:28:19,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-18 09:28:19,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:28:19,865 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-02-18 09:28:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:20,196 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-02-18 09:28:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 09:28:20,197 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-02-18 09:28:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:20,197 INFO L225 Difference]: With dead ends: 184 [2019-02-18 09:28:20,197 INFO L226 Difference]: Without dead ends: 123 [2019-02-18 09:28:20,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:28:20,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-18 09:28:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-02-18 09:28:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-18 09:28:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-02-18 09:28:20,201 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-02-18 09:28:20,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:20,202 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-02-18 09:28:20,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-18 09:28:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-02-18 09:28:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-02-18 09:28:20,202 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:20,203 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-02-18 09:28:20,203 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:20,203 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-02-18 09:28:20,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:20,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:20,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:20,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:20,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-18 09:28:21,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:21,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:21,605 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:21,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:21,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:21,605 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-18 09:28:21,613 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:21,613 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:22,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-18 09:28:22,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:22,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-18 09:28:22,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-02-18 09:28:26,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:26,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-18 09:28:26,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:26,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-18 09:28:26,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-18 09:28:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:28:26,558 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-02-18 09:28:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:26,863 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-02-18 09:28:26,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 09:28:26,864 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-02-18 09:28:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:26,865 INFO L225 Difference]: With dead ends: 187 [2019-02-18 09:28:26,865 INFO L226 Difference]: Without dead ends: 125 [2019-02-18 09:28:26,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:28:26,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-18 09:28:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-02-18 09:28:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-18 09:28:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-02-18 09:28:26,869 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-02-18 09:28:26,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:26,869 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-02-18 09:28:26,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-18 09:28:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-02-18 09:28:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-02-18 09:28:26,870 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:26,871 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-02-18 09:28:26,871 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:26,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:26,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-02-18 09:28:26,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:26,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:26,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:26,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:26,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-18 09:28:28,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:28,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:28,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:28,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:28,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:28,535 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-18 09:28:28,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:28,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:28,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:28,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:28,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-18 09:28:28,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-02-18 09:28:32,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:32,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-18 09:28:32,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:32,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-18 09:28:32,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-18 09:28:32,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:28:32,635 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-02-18 09:28:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:32,903 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-02-18 09:28:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 09:28:32,904 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-02-18 09:28:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:32,904 INFO L225 Difference]: With dead ends: 190 [2019-02-18 09:28:32,904 INFO L226 Difference]: Without dead ends: 127 [2019-02-18 09:28:32,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:28:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-18 09:28:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-02-18 09:28:32,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-18 09:28:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-02-18 09:28:32,908 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-02-18 09:28:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:32,908 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-02-18 09:28:32,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-18 09:28:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-02-18 09:28:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-18 09:28:32,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:32,909 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-02-18 09:28:32,909 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:32,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:32,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-02-18 09:28:32,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:32,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:32,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-18 09:28:34,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:34,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:34,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:34,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:34,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:34,360 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-18 09:28:34,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:34,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:34,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-18 09:28:34,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-02-18 09:28:38,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:38,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-18 09:28:38,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:38,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-18 09:28:38,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-18 09:28:38,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:28:38,713 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-02-18 09:28:39,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:39,055 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-02-18 09:28:39,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 09:28:39,055 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-02-18 09:28:39,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:39,056 INFO L225 Difference]: With dead ends: 193 [2019-02-18 09:28:39,056 INFO L226 Difference]: Without dead ends: 129 [2019-02-18 09:28:39,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:28:39,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-18 09:28:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-02-18 09:28:39,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-18 09:28:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-02-18 09:28:39,060 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-02-18 09:28:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:39,061 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-02-18 09:28:39,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-18 09:28:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-02-18 09:28:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-18 09:28:39,061 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:39,062 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-02-18 09:28:39,062 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:39,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-02-18 09:28:39,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:39,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:39,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:39,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-18 09:28:40,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:40,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:40,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:40,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:40,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:40,596 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-18 09:28:40,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:28:40,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:28:41,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-18 09:28:41,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:41,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-18 09:28:41,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-02-18 09:28:46,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:46,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-18 09:28:46,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:46,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:28:46,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:28:46,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:28:46,037 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-02-18 09:28:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:46,398 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-02-18 09:28:46,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 09:28:46,398 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-02-18 09:28:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:46,399 INFO L225 Difference]: With dead ends: 196 [2019-02-18 09:28:46,399 INFO L226 Difference]: Without dead ends: 131 [2019-02-18 09:28:46,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-18 09:28:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-18 09:28:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-02-18 09:28:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-02-18 09:28:46,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-02-18 09:28:46,403 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-02-18 09:28:46,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:46,403 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-02-18 09:28:46,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:28:46,403 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-02-18 09:28:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-02-18 09:28:46,404 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:46,404 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-02-18 09:28:46,404 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:46,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:46,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-02-18 09:28:46,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:46,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:46,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:46,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:46,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-18 09:28:48,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:48,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:48,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:48,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:48,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:48,200 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-18 09:28:48,211 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:28:48,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:28:48,299 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:28:48,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:28:48,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-18 09:28:48,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:28:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-02-18 09:28:52,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:28:52,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-18 09:28:52,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:28:52,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-18 09:28:52,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-18 09:28:52,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:28:52,523 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-02-18 09:28:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:28:52,888 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-02-18 09:28:52,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 09:28:52,889 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-02-18 09:28:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:28:52,889 INFO L225 Difference]: With dead ends: 199 [2019-02-18 09:28:52,890 INFO L226 Difference]: Without dead ends: 133 [2019-02-18 09:28:52,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:28:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-18 09:28:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-02-18 09:28:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-18 09:28:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-02-18 09:28:52,893 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-02-18 09:28:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:28:52,893 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-02-18 09:28:52,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-18 09:28:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-02-18 09:28:52,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-18 09:28:52,894 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:28:52,895 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-02-18 09:28:52,895 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:28:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:28:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-02-18 09:28:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:28:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:52,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:28:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:28:52,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:28:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-18 09:28:54,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:54,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:28:54,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:28:54,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:28:54,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:28:54,714 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-18 09:28:54,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:28:54,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:28:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:28:54,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:28:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-18 09:28:54,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-02-18 09:29:00,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:00,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-18 09:29:00,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:00,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-18 09:29:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-18 09:29:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-18 09:29:00,138 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-02-18 09:29:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:00,556 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-02-18 09:29:00,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 09:29:00,556 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-02-18 09:29:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:00,557 INFO L225 Difference]: With dead ends: 202 [2019-02-18 09:29:00,557 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 09:29:00,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-18 09:29:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 09:29:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-02-18 09:29:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-02-18 09:29:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-02-18 09:29:00,562 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-02-18 09:29:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:00,562 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-02-18 09:29:00,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-18 09:29:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-02-18 09:29:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-02-18 09:29:00,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:00,563 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-02-18 09:29:00,563 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:00,564 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-02-18 09:29:00,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:00,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:00,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:00,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:00,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:02,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-18 09:29:02,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:02,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:02,204 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:02,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:02,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:02,205 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-18 09:29:02,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:02,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:05,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-18 09:29:05,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:05,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-18 09:29:05,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-02-18 09:29:10,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:10,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-18 09:29:10,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:10,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-18 09:29:10,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-18 09:29:10,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:29:10,042 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-02-18 09:29:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:10,396 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-02-18 09:29:10,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 09:29:10,397 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-02-18 09:29:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:10,397 INFO L225 Difference]: With dead ends: 205 [2019-02-18 09:29:10,397 INFO L226 Difference]: Without dead ends: 137 [2019-02-18 09:29:10,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 09:29:10,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-18 09:29:10,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-02-18 09:29:10,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-18 09:29:10,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-02-18 09:29:10,401 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-02-18 09:29:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:10,402 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-02-18 09:29:10,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-18 09:29:10,402 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-02-18 09:29:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-18 09:29:10,402 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:10,402 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-02-18 09:29:10,403 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:10,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:10,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-02-18 09:29:10,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:10,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:10,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:10,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:10,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-18 09:29:12,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:12,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:12,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:12,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:12,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:12,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 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-18 09:29:12,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:12,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:12,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:12,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:12,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-18 09:29:12,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-02-18 09:29:18,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:18,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-18 09:29:18,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:18,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-18 09:29:18,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-18 09:29:18,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:29:18,048 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-02-18 09:29:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:18,489 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-02-18 09:29:18,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 09:29:18,490 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-02-18 09:29:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:18,490 INFO L225 Difference]: With dead ends: 208 [2019-02-18 09:29:18,490 INFO L226 Difference]: Without dead ends: 139 [2019-02-18 09:29:18,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:29:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-18 09:29:18,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-02-18 09:29:18,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-18 09:29:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-02-18 09:29:18,493 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-02-18 09:29:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:18,494 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-02-18 09:29:18,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-18 09:29:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-02-18 09:29:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-18 09:29:18,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:18,494 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-02-18 09:29:18,495 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:18,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-02-18 09:29:18,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:18,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:18,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:18,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:18,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:20,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-18 09:29:20,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:20,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:20,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:20,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:20,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:20,400 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:20,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:20,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:20,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-18 09:29:20,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-02-18 09:29:25,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:25,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-18 09:29:25,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:25,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-18 09:29:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-18 09:29:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:29:25,534 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-02-18 09:29:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:25,991 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-02-18 09:29:25,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 09:29:25,991 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-02-18 09:29:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:25,992 INFO L225 Difference]: With dead ends: 211 [2019-02-18 09:29:25,992 INFO L226 Difference]: Without dead ends: 141 [2019-02-18 09:29:25,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-18 09:29:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-18 09:29:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-02-18 09:29:25,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-02-18 09:29:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-02-18 09:29:25,996 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-02-18 09:29:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:25,996 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-02-18 09:29:25,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-18 09:29:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-02-18 09:29:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-02-18 09:29:25,997 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:25,997 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-02-18 09:29:25,997 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-02-18 09:29:25,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:25,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:25,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:25,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-18 09:29:27,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:27,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:27,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:27,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:27,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:27,750 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:27,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:27,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:31,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-18 09:29:31,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:31,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-18 09:29:31,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-02-18 09:29:36,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:36,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-18 09:29:36,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:36,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:29:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:29:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:29:36,283 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-02-18 09:29:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:36,762 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-02-18 09:29:36,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 09:29:36,762 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-02-18 09:29:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:36,763 INFO L225 Difference]: With dead ends: 214 [2019-02-18 09:29:36,763 INFO L226 Difference]: Without dead ends: 143 [2019-02-18 09:29:36,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:29:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-18 09:29:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-02-18 09:29:36,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-18 09:29:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-02-18 09:29:36,766 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-02-18 09:29:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:36,766 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-02-18 09:29:36,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:29:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-02-18 09:29:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-18 09:29:36,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:36,767 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-02-18 09:29:36,767 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:36,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:36,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-02-18 09:29:36,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:36,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:36,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-18 09:29:38,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:38,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:38,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:38,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:38,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:38,577 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:38,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:29:38,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:29:38,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:29:38,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:38,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:38,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-18 09:29:38,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:43,525 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-02-18 09:29:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-02-18 09:29:44,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:44,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-18 09:29:44,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:44,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-18 09:29:44,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-18 09:29:44,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:29:44,040 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-02-18 09:29:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:44,551 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-02-18 09:29:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 09:29:44,551 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-02-18 09:29:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:44,552 INFO L225 Difference]: With dead ends: 217 [2019-02-18 09:29:44,552 INFO L226 Difference]: Without dead ends: 145 [2019-02-18 09:29:44,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:29:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-18 09:29:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-02-18 09:29:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-18 09:29:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-02-18 09:29:44,555 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-02-18 09:29:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:44,556 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-02-18 09:29:44,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-18 09:29:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-02-18 09:29:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-18 09:29:44,556 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:44,557 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-02-18 09:29:44,557 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:44,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:44,557 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-02-18 09:29:44,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:44,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:29:44,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:44,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-18 09:29:46,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:46,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:46,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29: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-18 09:29:46,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29: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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:46,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:46,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:29:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:46,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-18 09:29:46,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:29:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-02-18 09:29:51,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:29:51,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-18 09:29:51,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:29:51,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-18 09:29:51,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-18 09:29:51,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-18 09:29:51,871 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-02-18 09:29:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:29:52,243 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-02-18 09:29:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-18 09:29:52,243 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-02-18 09:29:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:29:52,244 INFO L225 Difference]: With dead ends: 220 [2019-02-18 09:29:52,244 INFO L226 Difference]: Without dead ends: 147 [2019-02-18 09:29:52,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-18 09:29:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-02-18 09:29:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-02-18 09:29:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-18 09:29:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-02-18 09:29:52,248 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-02-18 09:29:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:29:52,248 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-02-18 09:29:52,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-18 09:29:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-02-18 09:29:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-18 09:29:52,249 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:29:52,250 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-02-18 09:29:52,250 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:29:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:29:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-02-18 09:29:52,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:29:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:52,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:29:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:29:52,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:29:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:29:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-18 09:29:54,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:54,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:29:54,308 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:29:54,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:29:54,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:29:54,308 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:29:54,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:29:54,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:29:56,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-18 09:29:56,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:29:56,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:29:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-18 09:29:57,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-02-18 09:30:02,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:02,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-18 09:30:02,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:02,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:30:02,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:30:02,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:30:02,560 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-02-18 09:30:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:03,097 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-02-18 09:30:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-18 09:30:03,097 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-02-18 09:30:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:03,098 INFO L225 Difference]: With dead ends: 223 [2019-02-18 09:30:03,098 INFO L226 Difference]: Without dead ends: 149 [2019-02-18 09:30:03,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-18 09:30:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-18 09:30:03,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-02-18 09:30:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-02-18 09:30:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-02-18 09:30:03,102 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-02-18 09:30:03,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:03,102 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-02-18 09:30:03,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:30:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-02-18 09:30:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-02-18 09:30:03,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:03,104 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-02-18 09:30:03,104 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:03,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-02-18 09:30:03,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:03,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:03,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-18 09:30:05,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:05,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:05,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:05,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:05,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:05,543 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:05,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:30:05,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:30:05,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:30:05,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:05,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:05,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-18 09:30:05,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:11,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-02-18 09:30:11,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:11,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-18 09:30:11,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:11,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-18 09:30:11,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-18 09:30:11,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:30:11,466 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-02-18 09:30:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:11,956 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-02-18 09:30:11,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 09:30:11,957 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-02-18 09:30:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:11,957 INFO L225 Difference]: With dead ends: 226 [2019-02-18 09:30:11,957 INFO L226 Difference]: Without dead ends: 151 [2019-02-18 09:30:11,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:30:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-18 09:30:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-02-18 09:30:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-18 09:30:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-02-18 09:30:11,962 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-02-18 09:30:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:11,962 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-02-18 09:30:11,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-18 09:30:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-02-18 09:30:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-18 09:30:11,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:11,963 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-02-18 09:30:11,964 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:11,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-02-18 09:30:11,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:11,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:11,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:11,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:11,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-18 09:30:14,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:14,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:14,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:14,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:14,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:14,030 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:14,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:14,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:30:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:14,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-18 09:30:14,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-02-18 09:30:20,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:20,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-18 09:30:20,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:20,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-18 09:30:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-18 09:30:20,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:30:20,505 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-02-18 09:30:20,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:20,977 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-02-18 09:30:20,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 09:30:20,977 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-02-18 09:30:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:20,978 INFO L225 Difference]: With dead ends: 229 [2019-02-18 09:30:20,978 INFO L226 Difference]: Without dead ends: 153 [2019-02-18 09:30:20,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:30:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-02-18 09:30:20,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-02-18 09:30:20,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-02-18 09:30:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-02-18 09:30:20,983 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-02-18 09:30:20,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:20,983 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-02-18 09:30:20,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-18 09:30:20,983 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-02-18 09:30:20,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-02-18 09:30:20,984 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:20,984 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-02-18 09:30:20,985 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:20,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:20,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-02-18 09:30:20,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:20,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:20,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-18 09:30:23,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:23,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:23,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:23,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:23,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:23,043 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:23,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:23,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:25,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-18 09:30:25,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:25,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-18 09:30:25,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-02-18 09:30:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-18 09:30:31,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:31,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:30:31,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:30:31,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:30:31,586 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-02-18 09:30:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:32,140 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-02-18 09:30:32,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-18 09:30:32,140 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-02-18 09:30:32,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:32,141 INFO L225 Difference]: With dead ends: 232 [2019-02-18 09:30:32,141 INFO L226 Difference]: Without dead ends: 155 [2019-02-18 09:30:32,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-18 09:30:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-18 09:30:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-02-18 09:30:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-02-18 09:30:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-02-18 09:30:32,146 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-02-18 09:30:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:32,146 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-02-18 09:30:32,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:30:32,146 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-02-18 09:30:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-02-18 09:30:32,147 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:32,147 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-02-18 09:30:32,147 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:32,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:32,147 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-02-18 09:30:32,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:32,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:32,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:32,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-18 09:30:34,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:34,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:34,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:34,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:34,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:34,296 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:30:34,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:30:34,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:30:34,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:34,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-18 09:30:34,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-02-18 09:30:40,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:40,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-18 09:30:40,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:40,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-18 09:30:40,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-18 09:30:40,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:30:40,889 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-02-18 09:30:41,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:41,537 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-02-18 09:30:41,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-18 09:30:41,538 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-02-18 09:30:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:41,539 INFO L225 Difference]: With dead ends: 235 [2019-02-18 09:30:41,539 INFO L226 Difference]: Without dead ends: 157 [2019-02-18 09:30:41,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:30:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-02-18 09:30:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-02-18 09:30:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-18 09:30:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-02-18 09:30:41,542 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-02-18 09:30:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:41,542 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-02-18 09:30:41,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-18 09:30:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-02-18 09:30:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-18 09:30:41,543 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:41,543 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-02-18 09:30:41,543 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:41,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:41,543 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-02-18 09:30:41,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:41,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:30:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:41,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-18 09:30:43,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:43,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:43,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:43,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:43,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:43,661 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:43,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:43,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:30:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:43,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:43,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-18 09:30:43,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:30:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-02-18 09:30:50,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:30:50,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-18 09:30:50,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:30:50,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-18 09:30:50,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-18 09:30:50,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:30:50,158 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-02-18 09:30:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:30:50,701 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-02-18 09:30:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-18 09:30:50,701 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-02-18 09:30:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:30:50,702 INFO L225 Difference]: With dead ends: 238 [2019-02-18 09:30:50,702 INFO L226 Difference]: Without dead ends: 159 [2019-02-18 09:30:50,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-18 09:30:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-18 09:30:50,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-02-18 09:30:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-02-18 09:30:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-02-18 09:30:50,707 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-02-18 09:30:50,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:30:50,707 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-02-18 09:30:50,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-18 09:30:50,707 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-02-18 09:30:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-02-18 09:30:50,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:30:50,708 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-02-18 09:30:50,708 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:30:50,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:30:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-02-18 09:30:50,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:30:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:30:50,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:30:50,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:30:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:30:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-18 09:30:53,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:53,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:30:53,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:30:53,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:30:53,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:30:53,117 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:30:53,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:30:53,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:30:57,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-18 09:30:57,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:30:57,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:30:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-18 09:30:57,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-02-18 09:31:04,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:04,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-18 09:31:04,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:04,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:31:04,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:31:04,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:31:04,176 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-02-18 09:31:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:04,843 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-02-18 09:31:04,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 09:31:04,844 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-02-18 09:31:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:04,844 INFO L225 Difference]: With dead ends: 241 [2019-02-18 09:31:04,845 INFO L226 Difference]: Without dead ends: 161 [2019-02-18 09:31:04,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 09:31:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-18 09:31:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-02-18 09:31:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-18 09:31:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-02-18 09:31:04,849 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-02-18 09:31:04,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:04,850 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-02-18 09:31:04,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:31:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-02-18 09:31:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-18 09:31:04,851 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:04,851 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-02-18 09:31:04,851 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:04,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:04,851 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-02-18 09:31:04,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:04,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:04,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:04,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-18 09:31:07,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:07,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:07,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:07,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:07,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:07,297 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:07,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:07,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:07,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:07,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:07,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-18 09:31:07,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-02-18 09:31:14,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:14,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-18 09:31:14,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:14,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-18 09:31:14,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-18 09:31:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:31:14,159 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-02-18 09:31:14,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:14,867 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-02-18 09:31:14,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-18 09:31:14,867 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-02-18 09:31:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:14,868 INFO L225 Difference]: With dead ends: 244 [2019-02-18 09:31:14,868 INFO L226 Difference]: Without dead ends: 163 [2019-02-18 09:31:14,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:31:14,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-18 09:31:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-02-18 09:31:14,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-18 09:31:14,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-02-18 09:31:14,873 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-02-18 09:31:14,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:14,873 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-02-18 09:31:14,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-18 09:31:14,874 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-02-18 09:31:14,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-18 09:31:14,874 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:14,875 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-02-18 09:31:14,875 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:14,875 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-02-18 09:31:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:14,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:14,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:14,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-18 09:31:17,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:17,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:17,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:17,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:17,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:17,513 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:17,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:17,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:31:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:17,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-18 09:31:17,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-02-18 09:31:24,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:24,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-18 09:31:24,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:24,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-18 09:31:24,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-18 09:31:24,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:31:24,507 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-02-18 09:31:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:25,261 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-02-18 09:31:25,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-18 09:31:25,261 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-02-18 09:31:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:25,262 INFO L225 Difference]: With dead ends: 247 [2019-02-18 09:31:25,262 INFO L226 Difference]: Without dead ends: 165 [2019-02-18 09:31:25,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-18 09:31:25,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-18 09:31:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-02-18 09:31:25,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-18 09:31:25,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-02-18 09:31:25,266 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-02-18 09:31:25,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:25,266 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-02-18 09:31:25,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-18 09:31:25,266 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-02-18 09:31:25,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-02-18 09:31:25,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:25,267 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-02-18 09:31:25,267 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:25,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-02-18 09:31:25,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:25,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:25,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:25,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:25,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:27,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-18 09:31:27,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:27,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:27,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:27,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:27,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:27,967 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:27,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:31:27,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:31:30,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-18 09:31:30,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:30,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-18 09:31:30,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-02-18 09:31:38,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:38,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-18 09:31:38,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:38,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-18 09:31:38,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-18 09:31:38,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:31:38,368 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-02-18 09:31:39,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:39,110 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-02-18 09:31:39,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 09:31:39,110 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-02-18 09:31:39,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:39,111 INFO L225 Difference]: With dead ends: 250 [2019-02-18 09:31:39,111 INFO L226 Difference]: Without dead ends: 167 [2019-02-18 09:31:39,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:31:39,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-18 09:31:39,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-02-18 09:31:39,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-18 09:31:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-02-18 09:31:39,115 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-02-18 09:31:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:39,115 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-02-18 09:31:39,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-18 09:31:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-02-18 09:31:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-18 09:31:39,116 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:39,116 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-02-18 09:31:39,116 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:39,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-02-18 09:31:39,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:39,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:39,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:39,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-18 09:31:41,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:41,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:41,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:41,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:41,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:41,484 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:41,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:31:41,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:31:41,603 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:31:41,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:31:41,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-18 09:31:41,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:31:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-02-18 09:31:49,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:31:49,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-18 09:31:49,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:31:49,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-18 09:31:49,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-18 09:31:49,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:31:49,079 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-02-18 09:31:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:31:49,703 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-02-18 09:31:49,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-18 09:31:49,703 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-02-18 09:31:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:31:49,704 INFO L225 Difference]: With dead ends: 253 [2019-02-18 09:31:49,704 INFO L226 Difference]: Without dead ends: 169 [2019-02-18 09:31:49,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:31:49,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-02-18 09:31:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-02-18 09:31:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-18 09:31:49,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-02-18 09:31:49,708 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-02-18 09:31:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:31:49,709 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-02-18 09:31:49,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-18 09:31:49,709 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-02-18 09:31:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-18 09:31:49,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:31:49,709 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-02-18 09:31:49,710 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:31:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:31:49,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-02-18 09:31:49,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:31:49,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:49,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:31:49,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:31:49,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:31:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-18 09:31:52,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:52,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:31:52,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:31:52,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:31:52,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:31:52,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:31:52,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:31:52,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:31:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:31:52,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:31:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-18 09:31:52,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:00,002 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-02-18 09:32:00,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:00,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-18 09:32:00,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:00,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-18 09:32:00,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-18 09:32:00,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:32:00,037 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-02-18 09:32:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:00,810 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-02-18 09:32:00,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-18 09:32:00,811 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-02-18 09:32:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:00,811 INFO L225 Difference]: With dead ends: 256 [2019-02-18 09:32:00,811 INFO L226 Difference]: Without dead ends: 171 [2019-02-18 09:32:00,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-18 09:32:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-18 09:32:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-02-18 09:32:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-18 09:32:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-02-18 09:32:00,815 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-02-18 09:32:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:00,815 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-02-18 09:32:00,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-18 09:32:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-02-18 09:32:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-18 09:32:00,816 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:00,816 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-02-18 09:32:00,816 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:00,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-02-18 09:32:00,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:00,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:00,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:00,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:00,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-18 09:32:03,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:03,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:03,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:03,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:03,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:03,624 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:03,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:32:03,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:32:12,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-18 09:32:12,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:12,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-18 09:32:12,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-02-18 09:32:20,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:20,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-18 09:32:20,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:20,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:32:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:32:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:32:20,283 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-02-18 09:32:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:21,107 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-02-18 09:32:21,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-18 09:32:21,107 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-02-18 09:32:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:21,108 INFO L225 Difference]: With dead ends: 259 [2019-02-18 09:32:21,108 INFO L226 Difference]: Without dead ends: 173 [2019-02-18 09:32:21,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-18 09:32:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-18 09:32:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-02-18 09:32:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-02-18 09:32:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-02-18 09:32:21,112 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-02-18 09:32:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:21,112 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-02-18 09:32:21,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:32:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-02-18 09:32:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-02-18 09:32:21,113 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:21,113 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-02-18 09:32:21,113 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:21,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:21,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-02-18 09:32:21,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:21,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:21,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:21,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-18 09:32:23,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:23,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:23,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:23,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:23,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:23,898 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:23,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:32:23,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:32:24,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:32:24,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:24,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-18 09:32:24,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-02-18 09:32:31,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:31,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-18 09:32:31,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:31,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-18 09:32:31,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-18 09:32:31,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:32:31,702 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-02-18 09:32:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:32,568 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-02-18 09:32:32,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-18 09:32:32,568 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-02-18 09:32:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:32,569 INFO L225 Difference]: With dead ends: 262 [2019-02-18 09:32:32,569 INFO L226 Difference]: Without dead ends: 175 [2019-02-18 09:32:32,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 09:32:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-18 09:32:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-02-18 09:32:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-18 09:32:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-02-18 09:32:32,574 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-02-18 09:32:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:32,574 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-02-18 09:32:32,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-18 09:32:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-02-18 09:32:32,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-18 09:32:32,575 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:32,576 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-02-18 09:32:32,576 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-02-18 09:32:32,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:32,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:32:32,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:32,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-18 09:32:35,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:35,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:35,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:35,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:35,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:35,472 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:35,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:35,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:32:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:35,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-18 09:32:35,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:32:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-02-18 09:32:43,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:32:43,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-18 09:32:43,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:32:43,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-18 09:32:43,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-18 09:32:43,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:32:43,757 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-02-18 09:32:44,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:32:44,628 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-02-18 09:32:44,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-18 09:32:44,629 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-02-18 09:32:44,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:32:44,629 INFO L225 Difference]: With dead ends: 265 [2019-02-18 09:32:44,629 INFO L226 Difference]: Without dead ends: 177 [2019-02-18 09:32:44,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 09:32:44,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-02-18 09:32:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-02-18 09:32:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-18 09:32:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-02-18 09:32:44,633 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-02-18 09:32:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:32:44,634 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-02-18 09:32:44,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-18 09:32:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-02-18 09:32:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-18 09:32:44,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:32:44,635 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-02-18 09:32:44,635 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:32:44,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:32:44,636 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-02-18 09:32:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:32:44,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:44,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:32:44,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:32:44,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:32:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:32:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-18 09:32:47,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:47,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:32:47,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:32:47,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:32:47,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:32:47,349 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:32:47,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:32:47,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:32:56,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-18 09:32:56,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:32:56,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:32:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-18 09:32:56,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-02-18 09:33:05,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:05,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-18 09:33:05,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:05,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:33:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:33:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 09:33:05,028 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-02-18 09:33:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:05,819 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-02-18 09:33:05,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-18 09:33:05,820 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-02-18 09:33:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:05,820 INFO L225 Difference]: With dead ends: 268 [2019-02-18 09:33:05,820 INFO L226 Difference]: Without dead ends: 179 [2019-02-18 09:33:05,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-18 09:33:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-18 09:33:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-02-18 09:33:05,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-02-18 09:33:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-02-18 09:33:05,825 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-02-18 09:33:05,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:05,825 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-02-18 09:33:05,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:33:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-02-18 09:33:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-02-18 09:33:05,826 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:05,826 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-02-18 09:33:05,826 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:05,827 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-02-18 09:33:05,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:05,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:05,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:05,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-18 09:33:08,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:08,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:08,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:08,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:08,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:08,570 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:33:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:33:08,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:33:08,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:33:08,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:08,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-18 09:33:08,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-02-18 09:33:17,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:17,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-18 09:33:17,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:17,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-18 09:33:17,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-18 09:33:17,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:33:17,175 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-02-18 09:33:18,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:18,115 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-02-18 09:33:18,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-18 09:33:18,116 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-02-18 09:33:18,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:18,117 INFO L225 Difference]: With dead ends: 271 [2019-02-18 09:33:18,117 INFO L226 Difference]: Without dead ends: 181 [2019-02-18 09:33:18,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 09:33:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-02-18 09:33:18,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-02-18 09:33:18,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-18 09:33:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-02-18 09:33:18,121 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-02-18 09:33:18,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:18,121 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-02-18 09:33:18,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-18 09:33:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-02-18 09:33:18,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-18 09:33:18,122 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:18,122 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-02-18 09:33:18,122 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:18,122 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-02-18 09:33:18,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:18,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:18,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:18,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-18 09:33:21,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:21,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:21,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:21,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:21,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:21,157 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:33:21,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:21,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:33:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:21,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:21,319 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-18 09:33:21,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-02-18 09:33:29,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:29,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-18 09:33:29,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:29,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-18 09:33:29,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-18 09:33:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 09:33:29,874 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-02-18 09:33:30,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:30,657 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-02-18 09:33:30,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-18 09:33:30,657 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-02-18 09:33:30,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:30,658 INFO L225 Difference]: With dead ends: 274 [2019-02-18 09:33:30,658 INFO L226 Difference]: Without dead ends: 183 [2019-02-18 09:33:30,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-18 09:33:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-02-18 09:33:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-02-18 09:33:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-02-18 09:33:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-02-18 09:33:30,662 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-02-18 09:33:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:30,662 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-02-18 09:33:30,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-18 09:33:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-02-18 09:33:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-02-18 09:33:30,663 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:30,663 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-02-18 09:33:30,663 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:30,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:30,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-02-18 09:33:30,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:30,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:30,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:33:30,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:30,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-18 09:33:33,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:33,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:33,658 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:33,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:33,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:33,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:33:33,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:33:33,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:33:38,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-18 09:33:38,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:38,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-18 09:33:38,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:33:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-02-18 09:33:47,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:33:47,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-18 09:33:47,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:33:47,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:33:47,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:33:47,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:33:47,203 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-02-18 09:33:47,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:33:47,958 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-02-18 09:33:47,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-18 09:33:47,959 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-02-18 09:33:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:33:47,960 INFO L225 Difference]: With dead ends: 277 [2019-02-18 09:33:47,960 INFO L226 Difference]: Without dead ends: 185 [2019-02-18 09:33:47,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-18 09:33:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-18 09:33:47,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-02-18 09:33:47,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-18 09:33:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-02-18 09:33:47,964 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-02-18 09:33:47,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:33:47,964 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-02-18 09:33:47,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:33:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-02-18 09:33:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-18 09:33:47,965 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:33:47,965 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-02-18 09:33:47,965 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:33:47,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:33:47,965 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-02-18 09:33:47,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:33:47,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:47,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:33:47,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:33:47,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:33:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:33:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-18 09:33:51,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:51,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:33:51,122 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:33:51,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:33:51,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:33:51,122 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:33:51,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:33:51,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:33:51,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:33:51,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:33:51,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:33:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-18 09:33:51,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-02-18 09:34:00,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:00,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-18 09:34:00,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:00,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-18 09:34:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-18 09:34:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:34:00,138 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-02-18 09:34:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:00,984 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-02-18 09:34:00,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-18 09:34:00,984 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-02-18 09:34:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:00,985 INFO L225 Difference]: With dead ends: 280 [2019-02-18 09:34:00,985 INFO L226 Difference]: Without dead ends: 187 [2019-02-18 09:34:00,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 09:34:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-18 09:34:00,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-02-18 09:34:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-18 09:34:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-02-18 09:34:00,990 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-02-18 09:34:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:00,990 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-02-18 09:34:00,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-18 09:34:00,990 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-02-18 09:34:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-18 09:34:00,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:00,991 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-02-18 09:34:00,991 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:00,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:00,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-02-18 09:34:00,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:00,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:00,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:00,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-18 09:34:03,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:03,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:03,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:03,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:03,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:03,943 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:34:03,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:03,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:34:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:04,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:04,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-18 09:34:04,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-02-18 09:34:13,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:13,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-18 09:34:13,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:13,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-18 09:34:13,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-18 09:34:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 09:34:13,231 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-02-18 09:34:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:14,311 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-02-18 09:34:14,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-18 09:34:14,312 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-02-18 09:34:14,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:14,312 INFO L225 Difference]: With dead ends: 283 [2019-02-18 09:34:14,312 INFO L226 Difference]: Without dead ends: 189 [2019-02-18 09:34:14,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-18 09:34:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-02-18 09:34:14,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-02-18 09:34:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-18 09:34:14,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-02-18 09:34:14,317 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-02-18 09:34:14,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:14,318 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-02-18 09:34:14,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-18 09:34:14,318 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-02-18 09:34:14,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-02-18 09:34:14,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:14,319 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-02-18 09:34:14,319 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:14,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:14,319 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-02-18 09:34:14,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:14,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:14,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:14,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-18 09:34:17,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:17,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:17,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:17,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:17,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:17,652 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:34:17,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:34:17,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:34:22,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-18 09:34:22,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:22,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-18 09:34:22,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:31,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-02-18 09:34:31,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:31,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-18 09:34:31,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:31,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 09:34:31,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 09:34:31,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 09:34:31,934 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-02-18 09:34:32,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:32,862 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-02-18 09:34:32,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-18 09:34:32,862 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-02-18 09:34:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:32,863 INFO L225 Difference]: With dead ends: 286 [2019-02-18 09:34:32,863 INFO L226 Difference]: Without dead ends: 191 [2019-02-18 09:34:32,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-18 09:34:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-18 09:34:32,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-02-18 09:34:32,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-18 09:34:32,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-02-18 09:34:32,870 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-02-18 09:34:32,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:32,870 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-02-18 09:34:32,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 09:34:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-02-18 09:34:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-02-18 09:34:32,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:32,871 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-02-18 09:34:32,871 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:32,872 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-02-18 09:34:32,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:32,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:32,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:32,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:32,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-18 09:34:36,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:36,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:36,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:36,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:36,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:36,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:34:36,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:34:36,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:34:36,458 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:34:36,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:34:36,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-18 09:34:36,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-02-18 09:34:45,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:45,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-18 09:34:45,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:45,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-18 09:34:45,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-18 09:34:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 09:34:45,763 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-02-18 09:34:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:34:46,876 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-02-18 09:34:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-18 09:34:46,876 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-02-18 09:34:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:34:46,877 INFO L225 Difference]: With dead ends: 289 [2019-02-18 09:34:46,877 INFO L226 Difference]: Without dead ends: 193 [2019-02-18 09:34:46,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 09:34:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-02-18 09:34:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-02-18 09:34:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-18 09:34:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-02-18 09:34:46,881 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-02-18 09:34:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:34:46,881 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-02-18 09:34:46,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-18 09:34:46,882 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-02-18 09:34:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-18 09:34:46,882 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:34:46,882 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-02-18 09:34:46,882 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:34:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:34:46,883 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-02-18 09:34:46,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:34:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:46,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:34:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:34:46,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:34:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-18 09:34:50,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:50,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:34:50,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:34:50,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:34:50,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:34:50,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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:34:50,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:34:50,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:34:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:34:50,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:34:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-18 09:34:50,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:34:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-02-18 09:34:59,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:34:59,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-18 09:34:59,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:34:59,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-18 09:34:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-18 09:34:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 09:34:59,998 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-02-18 09:35:01,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:01,157 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-02-18 09:35:01,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-18 09:35:01,158 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-02-18 09:35:01,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:01,159 INFO L225 Difference]: With dead ends: 292 [2019-02-18 09:35:01,159 INFO L226 Difference]: Without dead ends: 195 [2019-02-18 09:35:01,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-18 09:35:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-18 09:35:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-02-18 09:35:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-02-18 09:35:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-02-18 09:35:01,162 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-02-18 09:35:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:01,162 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-02-18 09:35:01,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-18 09:35:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-02-18 09:35:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-02-18 09:35:01,163 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:01,163 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-02-18 09:35:01,163 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:01,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:01,164 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-02-18 09:35:01,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:01,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:01,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:01,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:01,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-18 09:35:04,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:04,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:04,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:04,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:04,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:04,719 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:35:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:35:04,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:35:10,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-18 09:35:10,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:10,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-18 09:35:10,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:20,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-02-18 09:35:20,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:20,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-18 09:35:20,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:20,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-18 09:35:20,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-18 09:35:20,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 09:35:20,837 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-02-18 09:35:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:22,175 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-02-18 09:35:22,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-18 09:35:22,175 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-02-18 09:35:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:22,176 INFO L225 Difference]: With dead ends: 295 [2019-02-18 09:35:22,176 INFO L226 Difference]: Without dead ends: 197 [2019-02-18 09:35:22,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 09:35:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-18 09:35:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-02-18 09:35:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-18 09:35:22,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-02-18 09:35:22,181 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-02-18 09:35:22,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:22,181 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-02-18 09:35:22,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-18 09:35:22,181 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-02-18 09:35:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-18 09:35:22,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:22,182 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-02-18 09:35:22,182 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:22,183 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-02-18 09:35:22,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:22,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:22,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:22,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:22,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-18 09:35:26,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:26,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:26,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:26,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:26,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:26,042 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:35:26,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:35:26,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:35:26,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:35:26,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:35:26,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-18 09:35:26,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-02-18 09:35:36,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:36,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-18 09:35:36,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:36,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-18 09:35:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-18 09:35:36,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:35:36,488 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-02-18 09:35:37,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:37,821 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-02-18 09:35:37,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-18 09:35:37,821 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-02-18 09:35:37,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:37,822 INFO L225 Difference]: With dead ends: 298 [2019-02-18 09:35:37,822 INFO L226 Difference]: Without dead ends: 199 [2019-02-18 09:35:37,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:35:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-02-18 09:35:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-02-18 09:35:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-18 09:35:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-02-18 09:35:37,827 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-02-18 09:35:37,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:37,827 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-02-18 09:35:37,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-18 09:35:37,827 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-02-18 09:35:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-18 09:35:37,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:37,828 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-02-18 09:35:37,828 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:37,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-02-18 09:35:37,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:37,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:37,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:35:37,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:37,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:41,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-18 09:35:41,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:41,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:41,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:41,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:41,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:41,230 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:35:41,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:41,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:35:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:41,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:35:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-18 09:35:41,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:35:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-02-18 09:35:51,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:35:51,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-18 09:35:51,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:35:51,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-18 09:35:51,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-18 09:35:51,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 09:35:51,728 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-02-18 09:35:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:35:52,825 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-02-18 09:35:52,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-18 09:35:52,825 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-02-18 09:35:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:35:52,826 INFO L225 Difference]: With dead ends: 301 [2019-02-18 09:35:52,826 INFO L226 Difference]: Without dead ends: 201 [2019-02-18 09:35:52,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-18 09:35:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-18 09:35:52,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-02-18 09:35:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-02-18 09:35:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-02-18 09:35:52,830 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-02-18 09:35:52,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:35:52,830 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-02-18 09:35:52,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-18 09:35:52,830 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-02-18 09:35:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-02-18 09:35:52,831 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:35:52,831 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-02-18 09:35:52,831 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:35:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:35:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-02-18 09:35:52,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:35:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:52,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:35:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:35:52,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:35:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:35:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-18 09:35:56,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:56,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:35:56,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:35:56,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:35:56,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:35:56,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:35:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:35:56,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:36:11,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-18 09:36:11,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:11,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-18 09:36:11,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:21,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-02-18 09:36:21,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:21,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-18 09:36:21,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:21,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 09:36:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 09:36:21,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 09:36:21,879 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-02-18 09:36:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:23,285 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-02-18 09:36:23,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-18 09:36:23,285 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-02-18 09:36:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:23,286 INFO L225 Difference]: With dead ends: 304 [2019-02-18 09:36:23,286 INFO L226 Difference]: Without dead ends: 203 [2019-02-18 09:36:23,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-18 09:36:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-18 09:36:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-02-18 09:36:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-18 09:36:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-02-18 09:36:23,290 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-02-18 09:36:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:23,290 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-02-18 09:36:23,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 09:36:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-02-18 09:36:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-18 09:36:23,291 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:23,291 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-02-18 09:36:23,291 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:23,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-02-18 09:36:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:23,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:23,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-18 09:36:27,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:27,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:27,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:27,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:27,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:27,073 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:36:27,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:36:27,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:36:27,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:36:27,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:36:27,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-18 09:36:27,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:37,742 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-02-18 09:36:37,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:37,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-18 09:36:37,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:37,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-18 09:36:37,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-18 09:36:37,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 09:36:37,765 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-02-18 09:36:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:39,190 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-02-18 09:36:39,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-18 09:36:39,190 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-02-18 09:36:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:39,191 INFO L225 Difference]: With dead ends: 307 [2019-02-18 09:36:39,191 INFO L226 Difference]: Without dead ends: 205 [2019-02-18 09:36:39,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 09:36:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-18 09:36:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-02-18 09:36:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-18 09:36:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-02-18 09:36:39,196 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-02-18 09:36:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:39,196 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-02-18 09:36:39,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-18 09:36:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-02-18 09:36:39,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-18 09:36:39,197 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:39,197 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-02-18 09:36:39,197 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:39,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:39,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-02-18 09:36:39,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:39,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:39,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:36:39,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:39,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-18 09:36:42,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:42,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:42,881 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:42,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:42,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:42,881 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:36:42,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:42,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:36:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:43,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:36:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-18 09:36:43,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:36:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-02-18 09:36:53,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:36:53,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-18 09:36:53,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:36:53,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-18 09:36:53,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-18 09:36:54,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 09:36:54,001 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-02-18 09:36:55,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:36:55,367 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-02-18 09:36:55,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-18 09:36:55,367 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-02-18 09:36:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:36:55,368 INFO L225 Difference]: With dead ends: 310 [2019-02-18 09:36:55,368 INFO L226 Difference]: Without dead ends: 207 [2019-02-18 09:36:55,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-18 09:36:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-18 09:36:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-02-18 09:36:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-18 09:36:55,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-02-18 09:36:55,375 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-02-18 09:36:55,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:36:55,375 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-02-18 09:36:55,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-18 09:36:55,375 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-02-18 09:36:55,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-18 09:36:55,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:36:55,376 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-02-18 09:36:55,376 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:36:55,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:36:55,377 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-02-18 09:36:55,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:36:55,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:55,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:36:55,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:36:55,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:36:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:36:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-18 09:36:59,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:59,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:36:59,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:36:59,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:36:59,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:36:59,024 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:36:59,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:36:59,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:37:17,714 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-18 09:37:17,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:37:17,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-18 09:37:17,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-02-18 09:37:28,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:28,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-18 09:37:28,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:28,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-18 09:37:28,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-18 09:37:28,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 09:37:28,818 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-02-18 09:37:30,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:30,395 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-02-18 09:37:30,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-18 09:37:30,395 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-02-18 09:37:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:30,396 INFO L225 Difference]: With dead ends: 313 [2019-02-18 09:37:30,396 INFO L226 Difference]: Without dead ends: 209 [2019-02-18 09:37:30,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-18 09:37:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-18 09:37:30,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-02-18 09:37:30,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-02-18 09:37:30,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-02-18 09:37:30,402 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-02-18 09:37:30,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:30,402 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-02-18 09:37:30,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-18 09:37:30,402 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-02-18 09:37:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-02-18 09:37:30,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:30,403 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-02-18 09:37:30,403 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:30,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-02-18 09:37:30,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:30,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:30,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:37:30,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:30,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-18 09:37:34,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:34,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:34,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:34,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:34,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:34,132 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:34,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:37:34,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:37:34,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:37:34,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:37:34,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-18 09:37:34,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:37:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-02-18 09:37:45,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:37:45,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-18 09:37:45,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:37:45,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-18 09:37:45,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-18 09:37:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 09:37:45,921 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-02-18 09:37:47,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:37:47,292 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-02-18 09:37:47,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-18 09:37:47,293 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-02-18 09:37:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:37:47,293 INFO L225 Difference]: With dead ends: 316 [2019-02-18 09:37:47,294 INFO L226 Difference]: Without dead ends: 211 [2019-02-18 09:37:47,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 09:37:47,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-02-18 09:37:47,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-02-18 09:37:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-18 09:37:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-02-18 09:37:47,300 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-02-18 09:37:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:37:47,300 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-02-18 09:37:47,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-18 09:37:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-02-18 09:37:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-18 09:37:47,301 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:37:47,301 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-02-18 09:37:47,301 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:37:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:37:47,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-02-18 09:37:47,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:37:47,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:47,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:37:47,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:37:47,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:37:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:51,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-18 09:37:51,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:51,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:37:51,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:37:51,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:37:51,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:37:51,505 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:37:51,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:37:51,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:37:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:37:51,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:37:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-18 09:37:51,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-02-18 09:38:03,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:03,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-18 09:38:03,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:03,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-18 09:38:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-18 09:38:03,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-18 09:38:03,394 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-02-18 09:38:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:04,930 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-02-18 09:38:04,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-18 09:38:04,931 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-02-18 09:38:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:04,932 INFO L225 Difference]: With dead ends: 319 [2019-02-18 09:38:04,932 INFO L226 Difference]: Without dead ends: 213 [2019-02-18 09:38:04,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-18 09:38:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-02-18 09:38:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-02-18 09:38:04,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-18 09:38:04,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-02-18 09:38:04,939 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-02-18 09:38:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:04,939 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-02-18 09:38:04,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-18 09:38:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-02-18 09:38:04,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-18 09:38:04,940 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:04,940 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-02-18 09:38:04,940 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:04,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:04,941 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-02-18 09:38:04,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:04,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:04,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:38:04,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:04,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-18 09:38:09,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:09,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:09,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:09,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:09,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:09,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:09,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:38:09,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:38:17,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-18 09:38:17,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:17,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:17,626 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-18 09:38:17,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:38:29,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-02-18 09:38:29,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:38:29,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-18 09:38:29,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:38:29,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 09:38:29,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 09:38:29,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-18 09:38:29,481 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-02-18 09:38:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:38:30,816 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-02-18 09:38:30,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-18 09:38:30,817 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-02-18 09:38:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:38:30,817 INFO L225 Difference]: With dead ends: 322 [2019-02-18 09:38:30,817 INFO L226 Difference]: Without dead ends: 215 [2019-02-18 09:38:30,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-18 09:38:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-18 09:38:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-02-18 09:38:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-02-18 09:38:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-02-18 09:38:30,821 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-02-18 09:38:30,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:38:30,822 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-02-18 09:38:30,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 09:38:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-02-18 09:38:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-02-18 09:38:30,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:38:30,823 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-02-18 09:38:30,823 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:38:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:38:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-02-18 09:38:30,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:38:30,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:38:30,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:38:30,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:38:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:38:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-02-18 09:38:35,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:38:35,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:38:35,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:38:35,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:38:35,032 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:38:35,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:38:35,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:38:35,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:38:35,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:38:35,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:38:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-02-18 09:38:35,231 INFO L316 TraceCheckSpWp]: Computing backward predicates...