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/seq.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:38,607 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:38,609 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:38,623 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:38,623 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:38,624 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:38,625 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:38,627 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:38,629 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:38,630 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:38,631 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:38,631 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:38,632 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:38,633 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:38,634 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:38,635 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:38,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:38,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:38,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:38,648 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:38,649 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:38,652 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:38,656 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:38,657 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:38,657 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:38,659 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:38,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:38,664 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:38,665 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:38,667 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:38,668 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:38,668 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:38,670 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:38,670 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:38,671 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:38,672 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:38,673 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:41:38,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:38,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:38,700 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:38,700 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:38,700 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:38,700 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:38,700 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:38,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:38,701 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:38,701 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:38,701 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:38,702 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:38,702 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:38,702 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:38,703 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:38,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:38,705 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:38,706 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:38,706 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:38,706 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:38,706 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:38,707 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:38,708 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:38,708 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:38,708 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:38,708 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:38,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:38,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:38,709 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:38,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:38,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:38,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:38,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:38,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:38,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:38,710 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:38,711 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:38,711 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:38,711 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:38,711 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:38,711 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:38,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:38,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:38,787 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:38,789 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:38,790 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:38,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl [2018-12-03 15:41:38,791 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/seq.i_4.bpl' [2018-12-03 15:41:38,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:38,855 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:38,856 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:38,856 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:38,857 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:38,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:38,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:38,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:38,898 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:38,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... [2018-12-03 15:41:38,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:38,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:38,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:38,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:38,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:39,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:39,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:39,280 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:39,280 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-03 15:41:39,281 INFO L202 PluginConnector]: Adding new model seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:39 BoogieIcfgContainer [2018-12-03 15:41:39,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:39,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:39,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:39,285 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:39,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:38" (1/2) ... [2018-12-03 15:41:39,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455ad045 and model type seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:39, skipping insertion in model container [2018-12-03 15:41:39,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "seq.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:39" (2/2) ... [2018-12-03 15:41:39,289 INFO L112 eAbstractionObserver]: Analyzing ICFG seq.i_4.bpl [2018-12-03 15:41:39,299 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:39,308 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:39,327 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:39,370 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:39,370 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:39,371 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:39,371 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:39,371 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:39,371 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:39,371 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:39,372 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-12-03 15:41:39,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:41:39,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:39,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 15:41:39,410 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:39,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:39,418 INFO L82 PathProgramCache]: Analyzing trace with hash 28787175, now seen corresponding path program 1 times [2018-12-03 15:41:39,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:39,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:39,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:39,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:39,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:39,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:39,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:41:39,686 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:39,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:41:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:41:39,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:41:39,711 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 4 states. [2018-12-03 15:41:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:39,853 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-03 15:41:39,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:41:39,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-03 15:41:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:39,868 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:41:39,868 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:41:39,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:41:39,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:41:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:41:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:41:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 15:41:39,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 15:41:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:39,910 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 15:41:39,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:41:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 15:41:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:41:39,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:39,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:41:39,911 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:39,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:39,912 INFO L82 PathProgramCache]: Analyzing trace with hash 894126352, now seen corresponding path program 1 times [2018-12-03 15:41:39,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:39,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:39,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:39,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:39,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:40,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:40,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:40,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:41:40,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:40,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:41:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:41:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:41:40,063 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-12-03 15:41:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:40,209 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 15:41:40,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:41:40,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 15:41:40,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:40,211 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:41:40,211 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:41:40,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:41:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:41:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 15:41:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:41:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 15:41:40,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 15:41:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:40,217 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 15:41:40,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:41:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 15:41:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:41:40,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:40,218 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:40,219 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:40,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash 262017386, now seen corresponding path program 1 times [2018-12-03 15:41:40,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:40,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:40,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:40,221 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:40,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:40,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:40,384 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2018-12-03 15:41:40,386 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17] [2018-12-03 15:41:40,428 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:40,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:40,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:41:40,739 INFO L272 AbstractInterpreter]: Visited 7 different actions 30 times. Merged at 6 different actions 20 times. Widened at 2 different actions 2 times. Found 5 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 15:41:40,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:40,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:41:40,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:40,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:40,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:40,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:40,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:41,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:41,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:41,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:41,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:41:41,202 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:41,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:41:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:41:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:41:41,204 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 10 states. [2018-12-03 15:41:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:41,476 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 15:41:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:41:41,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2018-12-03 15:41:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:41,478 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:41:41,478 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:41:41,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:41:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:41:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:41:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:41:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 15:41:41,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-12-03 15:41:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:41,483 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 15:41:41,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:41:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 15:41:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:41:41,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:41,484 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:41:41,485 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:41,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:41,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1187728801, now seen corresponding path program 2 times [2018-12-03 15:41:41,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:41,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:41,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:41,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:41,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:41,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:41,609 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:41,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:41,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:41,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:41,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:41,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:41,620 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:41,644 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:41:41,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:41,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:41,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:41,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:41,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:41,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2018-12-03 15:41:41,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:41,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:41:41,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:41:41,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:41:41,880 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 8 states. [2018-12-03 15:41:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:42,165 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-12-03 15:41:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:41:42,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 15:41:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:42,166 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:41:42,166 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:41:42,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:41:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:41:42,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 15:41:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:41:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 15:41:42,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2018-12-03 15:41:42,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:42,172 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 15:41:42,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:41:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 15:41:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:41:42,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:42,173 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2018-12-03 15:41:42,173 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:42,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:42,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1053870661, now seen corresponding path program 3 times [2018-12-03 15:41:42,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:42,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:42,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:42,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:42,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:42,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:42,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:42,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:42,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:42,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:42,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:42,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:42,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:42,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:42,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:42,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:42,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:41:42,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:42,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:41:42,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:41:42,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:41:42,834 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 14 states. [2018-12-03 15:41:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:42,967 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-12-03 15:41:42,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:41:42,967 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 11 [2018-12-03 15:41:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:42,968 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:41:42,968 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:41:42,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:41:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:41:42,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:41:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:41:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 15:41:42,972 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-12-03 15:41:42,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:42,972 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 15:41:42,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:41:42,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 15:41:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:41:42,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:42,973 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1] [2018-12-03 15:41:42,974 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:42,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1170114012, now seen corresponding path program 4 times [2018-12-03 15:41:42,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:42,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:42,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:42,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:42,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:43,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:43,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:43,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:43,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:43,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:43,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:43,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:43,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:43,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:43,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:43,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:43,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:43,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 8 [2018-12-03 15:41:43,348 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:43,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:41:43,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:41:43,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:41:43,349 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 9 states. [2018-12-03 15:41:43,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:43,530 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 15:41:43,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:41:43,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2018-12-03 15:41:43,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:43,531 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:41:43,532 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:41:43,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:41:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:41:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 15:41:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:41:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 15:41:43,538 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-03 15:41:43,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:43,539 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 15:41:43,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:41:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 15:41:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:41:43,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:43,540 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2018-12-03 15:41:43,540 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:43,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash 801918334, now seen corresponding path program 5 times [2018-12-03 15:41:43,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:43,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:43,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:43,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:43,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:43,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:43,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:43,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:43,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:43,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:43,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:43,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:43,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:43,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:41:43,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:43,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:43,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:44,016 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:44,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:44,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:41:44,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:44,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:41:44,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:41:44,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:41:44,037 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 18 states. [2018-12-03 15:41:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:44,181 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-03 15:41:44,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:41:44,182 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 14 [2018-12-03 15:41:44,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:44,183 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:41:44,183 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:41:44,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 12 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:41:44,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:41:44,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:41:44,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:41:44,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-03 15:41:44,188 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-03 15:41:44,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:44,188 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-03 15:41:44,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:41:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-03 15:41:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:41:44,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:44,189 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1] [2018-12-03 15:41:44,189 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:44,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash -460110731, now seen corresponding path program 6 times [2018-12-03 15:41:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:44,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:44,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:44,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:44,310 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:44,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:44,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:44,310 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:44,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:44,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:44,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:44,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:44,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:44,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:44,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:44,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:44,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:44,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:44,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2018-12-03 15:41:44,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:44,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:41:44,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:41:44,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:41:44,480 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 10 states. [2018-12-03 15:41:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:44,591 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-03 15:41:44,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:41:44,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-12-03 15:41:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:44,593 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:41:44,593 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:41:44,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:41:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:41:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 15:41:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:41:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-03 15:41:44,599 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 15 [2018-12-03 15:41:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:44,599 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-03 15:41:44,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:41:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-03 15:41:44,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:41:44,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:44,600 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2018-12-03 15:41:44,600 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:44,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 215271311, now seen corresponding path program 7 times [2018-12-03 15:41:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:44,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:44,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:44,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:44,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:44,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:44,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:44,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:44,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:44,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:44,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:44,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:45,011 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:45,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:45,195 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:45,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:45,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:41:45,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:45,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:41:45,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:41:45,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:41:45,218 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 22 states. [2018-12-03 15:41:45,731 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-03 15:41:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:45,734 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-03 15:41:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:41:45,734 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 17 [2018-12-03 15:41:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:45,735 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:41:45,735 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:41:45,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:41:45,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:41:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:41:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:41:45,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 15:41:45,741 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-12-03 15:41:45,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:45,741 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 15:41:45,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:41:45,741 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 15:41:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:41:45,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:45,742 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2018-12-03 15:41:45,742 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:45,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:45,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1251105080, now seen corresponding path program 8 times [2018-12-03 15:41:45,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:45,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:45,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:45,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:45,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:46,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:46,206 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:46,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:46,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:46,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:46,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:46,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:41:46,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:46,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:46,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:46,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:46,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 10 [2018-12-03 15:41:46,602 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:46,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:41:46,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:41:46,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:41:46,603 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 11 states. [2018-12-03 15:41:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:46,744 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 15:41:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:41:46,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-12-03 15:41:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:46,746 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:41:46,746 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:41:46,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:41:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:41:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-12-03 15:41:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:41:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 15:41:46,753 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 15:41:46,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:46,753 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 15:41:46,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:41:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 15:41:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:41:46,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:46,754 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2018-12-03 15:41:46,755 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:46,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash -278808686, now seen corresponding path program 9 times [2018-12-03 15:41:46,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:46,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:46,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:46,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:46,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:46,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:46,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:46,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:46,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:46,984 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:46,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:47,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:47,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:47,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:47,522 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 15:41:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:47,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:48,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:48,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 15:41:48,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:48,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:41:48,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:41:48,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:41:48,019 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 26 states. [2018-12-03 15:41:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:48,352 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-12-03 15:41:48,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:41:48,353 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 20 [2018-12-03 15:41:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:48,353 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:41:48,354 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:41:48,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:41:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:41:48,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:41:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:41:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-03 15:41:48,360 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-12-03 15:41:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:48,360 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-03 15:41:48,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:41:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-03 15:41:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:41:48,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:48,361 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1] [2018-12-03 15:41:48,361 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:48,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:48,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1095018167, now seen corresponding path program 10 times [2018-12-03 15:41:48,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:48,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:48,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:48,552 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:48,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:48,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:48,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:48,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:48,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:48,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:48,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:48,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:48,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:48,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:48,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:48,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 11 [2018-12-03 15:41:48,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:48,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:41:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:41:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:41:48,738 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 12 states. [2018-12-03 15:41:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:48,890 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-12-03 15:41:48,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:41:48,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-12-03 15:41:48,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:48,892 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:41:48,893 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:41:48,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 12 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=214, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:41:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:41:48,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2018-12-03 15:41:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:41:48,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-03 15:41:48,900 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 21 [2018-12-03 15:41:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:48,900 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-03 15:41:48,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:41:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-03 15:41:48,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:41:48,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:48,901 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2018-12-03 15:41:48,902 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:48,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash -45418653, now seen corresponding path program 11 times [2018-12-03 15:41:48,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:48,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:49,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:49,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:49,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:49,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:49,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:49,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:49,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:49,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:49,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:41:49,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:49,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:49,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:49,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:49,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:41:49,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:49,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:41:49,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:41:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:41:49,661 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 30 states. [2018-12-03 15:41:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:49,893 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-03 15:41:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:41:49,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 23 [2018-12-03 15:41:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:49,894 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:41:49,894 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:41:49,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 13 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=302, Invalid=1030, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:41:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:41:49,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:41:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:41:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 15:41:49,900 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-12-03 15:41:49,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:49,900 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 15:41:49,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:41:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 15:41:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:41:49,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:49,901 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1] [2018-12-03 15:41:49,901 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:49,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:49,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1932204468, now seen corresponding path program 12 times [2018-12-03 15:41:49,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:49,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:49,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:49,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:49,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:50,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:50,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:50,011 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:50,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:50,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:50,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:50,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:50,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:50,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:50,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:50,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:50,211 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:50,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 28 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:50,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:50,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 12 [2018-12-03 15:41:50,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:50,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:41:50,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:41:50,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:41:50,329 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 15:41:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:50,577 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 15:41:50,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:41:50,578 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 15:41:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:50,579 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:41:50,579 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:41:50,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:41:50,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:41:50,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-12-03 15:41:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:41:50,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 15:41:50,586 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 15:41:50,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:50,587 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 15:41:50,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:41:50,587 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 15:41:50,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:41:50,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:50,588 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2018-12-03 15:41:50,588 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:50,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1422569562, now seen corresponding path program 13 times [2018-12-03 15:41:50,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:50,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:50,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:50,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:50,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:50,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:50,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:50,771 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:50,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:50,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:50,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:50,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:50,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:50,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:51,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 56 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:51,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:51,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:41:51,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:51,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:41:51,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:41:51,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=873, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:41:51,368 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 34 states. [2018-12-03 15:41:51,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:51,683 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-03 15:41:51,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:41:51,683 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 26 [2018-12-03 15:41:51,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:51,684 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:41:51,684 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:41:51,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 15 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:41:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:41:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:41:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:41:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-03 15:41:51,691 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-03 15:41:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:51,691 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-03 15:41:51,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:41:51,691 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-03 15:41:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:41:51,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:51,692 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1] [2018-12-03 15:41:51,692 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:51,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:51,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1873185821, now seen corresponding path program 14 times [2018-12-03 15:41:51,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:51,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:51,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:51,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:51,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:52,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:52,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:52,517 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:52,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:52,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:52,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:52,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:52,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:52,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:41:52,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:52,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:52,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 36 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:52,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:52,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 13 [2018-12-03 15:41:52,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:52,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:41:52,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:41:52,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:41:52,936 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-12-03 15:41:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:53,172 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-12-03 15:41:53,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:41:53,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-03 15:41:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:53,173 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:41:53,173 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:41:53,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:41:53,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:41:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-03 15:41:53,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:41:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-03 15:41:53,180 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2018-12-03 15:41:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:53,180 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-03 15:41:53,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:41:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-03 15:41:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:41:53,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:53,181 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1] [2018-12-03 15:41:53,181 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:53,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:53,181 INFO L82 PathProgramCache]: Analyzing trace with hash 540329271, now seen corresponding path program 15 times [2018-12-03 15:41:53,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:53,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:53,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:53,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:53,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:53,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:53,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:53,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:53,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:53,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:53,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:53,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:53,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:53,528 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:53,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:53,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:53,957 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:53,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:54,082 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 72 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:54,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:54,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 15:41:54,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:54,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:41:54,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:41:54,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1099, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:41:54,102 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 38 states. [2018-12-03 15:41:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:54,644 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-03 15:41:54,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:41:54,644 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 29 [2018-12-03 15:41:54,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:54,645 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:41:54,645 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:41:54,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 17 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=469, Invalid=1693, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:41:54,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:41:54,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:41:54,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:41:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 15:41:54,653 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-12-03 15:41:54,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:54,653 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 15:41:54,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:41:54,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 15:41:54,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:41:54,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:54,655 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1] [2018-12-03 15:41:54,655 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:54,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:54,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1436557664, now seen corresponding path program 16 times [2018-12-03 15:41:54,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:54,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:54,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:54,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:54,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:55,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:55,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:55,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:55,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:55,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:55,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:55,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:55,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:55,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:55,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 45 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:55,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:55,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 14 [2018-12-03 15:41:55,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:55,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:41:55,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:41:55,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:41:55,640 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 15 states. [2018-12-03 15:41:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:55,849 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 15:41:55,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:41:55,849 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-12-03 15:41:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:55,850 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:41:55,850 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:41:55,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 48 SyntacticMatches, 18 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=376, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:41:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:41:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-03 15:41:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:41:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 15:41:55,859 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-03 15:41:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:55,859 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 15:41:55,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:41:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 15:41:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:41:55,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:55,860 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1] [2018-12-03 15:41:55,861 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:55,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:55,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1847465402, now seen corresponding path program 17 times [2018-12-03 15:41:55,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:55,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:55,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:56,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:56,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:56,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:56,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:56,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:56,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:56,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:41:56,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:41:57,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:41:57,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:57,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:57,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:57,998 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 90 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:58,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:58,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:41:58,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:58,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:41:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:41:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=371, Invalid=1351, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:41:58,019 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 42 states. [2018-12-03 15:41:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:58,436 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-03 15:41:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:41:58,437 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 32 [2018-12-03 15:41:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:58,438 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:41:58,438 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:41:58,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 24 SyntacticMatches, 19 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1262 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=566, Invalid=2086, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:41:58,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:41:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:41:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:41:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-03 15:41:58,445 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-12-03 15:41:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:58,446 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-03 15:41:58,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:41:58,446 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-03 15:41:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:41:58,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:58,447 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1] [2018-12-03 15:41:58,447 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:58,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:58,447 INFO L82 PathProgramCache]: Analyzing trace with hash -424157967, now seen corresponding path program 18 times [2018-12-03 15:41:58,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:58,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:58,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:58,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:58,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:58,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:58,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:58,693 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:58,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:58,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:58,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:58,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:41:58,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:41:58,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:41:58,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:41:58,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:41:58,764 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:58,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:41:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:58,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:41:58,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 15 [2018-12-03 15:41:58,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:41:58,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:41:58,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:41:58,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:41:58,972 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 16 states. [2018-12-03 15:41:59,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:59,154 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-12-03 15:41:59,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:41:59,155 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-12-03 15:41:59,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:59,156 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:41:59,156 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:41:59,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 53 SyntacticMatches, 20 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=440, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:41:59,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:41:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-12-03 15:41:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:41:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-03 15:41:59,162 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 33 [2018-12-03 15:41:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:59,162 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-03 15:41:59,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:41:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-03 15:41:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:41:59,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:59,163 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1] [2018-12-03 15:41:59,164 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:59,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 406139147, now seen corresponding path program 19 times [2018-12-03 15:41:59,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:59,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:59,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:41:59,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:59,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:59,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:59,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:41:59,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:41:59,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:41:59,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:41:59,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:41:59,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:59,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:41:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:59,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:00,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 110 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:00,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:00,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:42:00,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:00,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:42:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:42:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=1629, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:42:00,591 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 46 states. [2018-12-03 15:42:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:01,124 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-03 15:42:01,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:42:01,125 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 35 [2018-12-03 15:42:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:01,125 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:42:01,125 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:42:01,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 26 SyntacticMatches, 21 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=672, Invalid=2520, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:42:01,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:42:01,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:42:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:42:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 15:42:01,133 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-12-03 15:42:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:01,134 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 15:42:01,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:42:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 15:42:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:42:01,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:01,135 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1] [2018-12-03 15:42:01,135 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:01,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:01,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2020930956, now seen corresponding path program 20 times [2018-12-03 15:42:01,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:01,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:01,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:01,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:01,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:01,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:01,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:01,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:01,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:01,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:01,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:01,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:01,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:01,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:42:01,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:01,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:01,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 66 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:01,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:01,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 16 [2018-12-03 15:42:01,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:01,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:42:01,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:42:01,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:42:01,630 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 17 states. [2018-12-03 15:42:01,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:01,892 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 15:42:01,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:42:01,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-12-03 15:42:01,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:01,896 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:42:01,896 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:42:01,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 22 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=509, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:42:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:42:01,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-03 15:42:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:42:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 15:42:01,905 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-03 15:42:01,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:01,906 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 15:42:01,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:42:01,906 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 15:42:01,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:42:01,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:01,907 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2018-12-03 15:42:01,907 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:01,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:01,907 INFO L82 PathProgramCache]: Analyzing trace with hash -789378610, now seen corresponding path program 21 times [2018-12-03 15:42:01,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:01,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:01,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:01,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:01,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:02,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:02,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:02,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:02,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:02,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:02,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:02,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:02,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:02,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:02,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:02,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:03,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 132 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:03,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:03,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 15:42:03,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:03,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:42:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:42:03,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=517, Invalid=1933, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:42:03,888 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 50 states. [2018-12-03 15:42:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:04,441 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 15:42:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:42:04,442 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 38 [2018-12-03 15:42:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:04,442 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:42:04,443 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:42:04,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 28 SyntacticMatches, 23 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=787, Invalid=2995, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:42:04,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:42:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:42:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:42:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-03 15:42:04,452 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-03 15:42:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:04,452 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-03 15:42:04,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:42:04,452 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-03 15:42:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:42:04,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:04,453 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 1, 1, 1, 1] [2018-12-03 15:42:04,453 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:04,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:04,453 INFO L82 PathProgramCache]: Analyzing trace with hash 139611077, now seen corresponding path program 22 times [2018-12-03 15:42:04,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:04,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:04,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:04,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:04,704 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:04,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:04,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:04,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:04,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:04,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:04,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:04,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:04,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:04,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:04,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:04,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:04,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 17 [2018-12-03 15:42:04,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:04,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:42:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:42:04,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:42:04,936 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 18 states. [2018-12-03 15:42:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:05,192 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-12-03 15:42:05,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:42:05,192 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-12-03 15:42:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:05,193 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:42:05,193 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:42:05,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 24 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=347, Invalid=583, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:42:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:42:05,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-03 15:42:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:42:05,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-03 15:42:05,203 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 39 [2018-12-03 15:42:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:05,203 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-03 15:42:05,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:42:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-03 15:42:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:42:05,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:05,204 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1] [2018-12-03 15:42:05,204 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:05,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:05,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1022311135, now seen corresponding path program 23 times [2018-12-03 15:42:05,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:05,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:05,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:05,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:05,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:05,717 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:05,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:05,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:05,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:05,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:05,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:05,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:05,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:05,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:05,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:42:05,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:05,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:06,310 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:06,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 156 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:06,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:06,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 15:42:06,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:06,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:42:06,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:42:06,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=2263, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:42:06,546 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 54 states. [2018-12-03 15:42:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:07,028 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 15:42:07,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:42:07,028 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 41 [2018-12-03 15:42:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:07,029 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:42:07,029 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:42:07,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 30 SyntacticMatches, 25 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=911, Invalid=3511, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:42:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:42:07,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:42:07,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:42:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 15:42:07,038 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 41 [2018-12-03 15:42:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:07,039 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 15:42:07,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:42:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 15:42:07,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:42:07,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:07,039 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 1, 1, 1, 1] [2018-12-03 15:42:07,040 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:07,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:07,040 INFO L82 PathProgramCache]: Analyzing trace with hash -215178872, now seen corresponding path program 24 times [2018-12-03 15:42:07,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:07,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:07,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:07,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:07,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:07,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:07,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:07,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:07,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:07,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:07,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:07,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:07,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:07,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:07,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:07,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:07,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:07,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 18 [2018-12-03 15:42:07,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:07,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:42:07,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:42:07,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:42:07,863 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 19 states. [2018-12-03 15:42:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:08,236 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 15:42:08,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:42:08,236 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-12-03 15:42:08,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:08,237 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:42:08,237 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:42:08,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 68 SyntacticMatches, 26 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=394, Invalid=662, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:42:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:42:08,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-03 15:42:08,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:42:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 15:42:08,246 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 15:42:08,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:08,246 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 15:42:08,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:42:08,247 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 15:42:08,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:42:08,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:08,247 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1] [2018-12-03 15:42:08,248 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:08,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:08,248 INFO L82 PathProgramCache]: Analyzing trace with hash -628413470, now seen corresponding path program 25 times [2018-12-03 15:42:08,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:08,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:08,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:08,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:08,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:08,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:08,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:08,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:08,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:08,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:08,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:08,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:08,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:08,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:09,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:09,634 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 182 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:09,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:09,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 15:42:09,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:09,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:42:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:42:09,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=687, Invalid=2619, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:42:09,656 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 58 states. [2018-12-03 15:42:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:10,234 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 15:42:10,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:42:10,234 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 44 [2018-12-03 15:42:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:10,235 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:42:10,235 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:42:10,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 32 SyntacticMatches, 27 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1044, Invalid=4068, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:42:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:42:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:42:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:42:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-03 15:42:10,246 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-12-03 15:42:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:10,246 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-03 15:42:10,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:42:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-03 15:42:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:42:10,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:10,247 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 1, 1, 1, 1] [2018-12-03 15:42:10,247 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:10,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1306056857, now seen corresponding path program 26 times [2018-12-03 15:42:10,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:10,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:10,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:10,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:10,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:10,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:10,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:10,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:10,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:10,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:10,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:10,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:10,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:10,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:42:10,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:10,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:10,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 105 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:10,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:10,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 19 [2018-12-03 15:42:10,780 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:10,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:42:10,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:42:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:42:10,781 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 20 states. [2018-12-03 15:42:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:11,048 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-12-03 15:42:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:42:11,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-12-03 15:42:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:11,050 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:42:11,050 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:42:11,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 73 SyntacticMatches, 28 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=444, Invalid=746, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:42:11,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:42:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-12-03 15:42:11,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:42:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-03 15:42:11,058 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 45 [2018-12-03 15:42:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:11,058 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-03 15:42:11,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:42:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-03 15:42:11,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:42:11,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:11,059 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1] [2018-12-03 15:42:11,059 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:11,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash 990241459, now seen corresponding path program 27 times [2018-12-03 15:42:11,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:11,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:11,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:11,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:11,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:11,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:11,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:11,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:11,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:11,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:11,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:11,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:11,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:11,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:11,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:11,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:12,284 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:12,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 210 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:12,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:12,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 15:42:12,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:12,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:42:12,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:42:12,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=3001, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:42:12,597 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 62 states. [2018-12-03 15:42:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:13,845 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-12-03 15:42:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:42:13,846 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 47 [2018-12-03 15:42:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:13,846 INFO L225 Difference]: With dead ends: 82 [2018-12-03 15:42:13,846 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:42:13,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 34 SyntacticMatches, 29 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2942 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1186, Invalid=4666, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:42:13,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:42:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:42:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:42:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 15:42:13,856 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-12-03 15:42:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:13,856 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 15:42:13,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:42:13,856 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 15:42:13,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:42:13,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:13,857 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 1, 1, 1, 1] [2018-12-03 15:42:13,857 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:13,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:13,858 INFO L82 PathProgramCache]: Analyzing trace with hash 924575388, now seen corresponding path program 28 times [2018-12-03 15:42:13,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:13,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:13,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:13,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:13,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:14,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:14,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:14,166 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:14,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:14,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:14,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:14,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:14,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:14,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:14,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 120 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:14,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:14,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 20 [2018-12-03 15:42:14,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:14,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:42:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:42:14,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:42:14,557 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-12-03 15:42:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:14,827 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 15:42:14,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:42:14,827 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-12-03 15:42:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:14,828 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:42:14,828 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:42:14,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 78 SyntacticMatches, 30 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=497, Invalid=835, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:42:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:42:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-12-03 15:42:14,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:42:14,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 15:42:14,837 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 15:42:14,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:14,837 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 15:42:14,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:42:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 15:42:14,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:42:14,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:14,838 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1] [2018-12-03 15:42:14,838 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:14,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:14,838 INFO L82 PathProgramCache]: Analyzing trace with hash -541230090, now seen corresponding path program 29 times [2018-12-03 15:42:14,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:14,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:14,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:14,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:15,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:15,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:15,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:15,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:15,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:15,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:15,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:15,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:15,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:42:15,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:15,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:16,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 240 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:16,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:16,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 15:42:16,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:16,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:42:16,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:42:16,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=3409, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:42:16,730 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 66 states. [2018-12-03 15:42:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:17,184 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-12-03 15:42:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:42:17,184 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 50 [2018-12-03 15:42:17,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:17,185 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:42:17,185 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:42:17,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 36 SyntacticMatches, 31 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3362 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1337, Invalid=5305, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:42:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:42:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:42:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:42:17,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-03 15:42:17,193 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-03 15:42:17,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:17,193 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-03 15:42:17,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:42:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-03 15:42:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:42:17,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:17,194 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 1, 1, 1, 1] [2018-12-03 15:42:17,194 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:17,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1705935725, now seen corresponding path program 30 times [2018-12-03 15:42:17,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:17,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:17,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:17,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:17,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:17,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:17,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:17,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:17,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:17,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:17,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:17,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:17,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:17,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:17,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 136 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:17,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:17,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 21 [2018-12-03 15:42:17,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:17,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:42:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:42:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:42:17,858 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 22 states. [2018-12-03 15:42:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:18,155 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-12-03 15:42:18,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:42:18,156 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-12-03 15:42:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:18,157 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:42:18,157 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:42:18,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 32 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=553, Invalid=929, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:42:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:42:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-12-03 15:42:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:42:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-03 15:42:18,168 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 51 [2018-12-03 15:42:18,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:18,168 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-03 15:42:18,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:42:18,168 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-03 15:42:18,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:42:18,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:18,169 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1] [2018-12-03 15:42:18,169 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:18,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:18,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1273223033, now seen corresponding path program 31 times [2018-12-03 15:42:18,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:18,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:18,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:18,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:18,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:18,700 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:18,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:18,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:18,700 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:18,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:18,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:18,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:18,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:18,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:18,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:19,702 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:19,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 272 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:20,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:20,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 15:42:20,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:20,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:42:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:42:20,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=987, Invalid=3843, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:42:20,080 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 70 states. [2018-12-03 15:42:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:21,091 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 15:42:21,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:42:21,091 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 53 [2018-12-03 15:42:21,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:21,092 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:42:21,092 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:42:21,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 38 SyntacticMatches, 33 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3810 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1497, Invalid=5985, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:42:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:42:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:42:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:42:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 15:42:21,101 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 53 [2018-12-03 15:42:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:21,102 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 15:42:21,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:42:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 15:42:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:42:21,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:21,102 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 1, 1, 1, 1] [2018-12-03 15:42:21,103 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:21,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1611671120, now seen corresponding path program 32 times [2018-12-03 15:42:21,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:21,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:21,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:21,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:21,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:21,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:21,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:21,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:21,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:21,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:21,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:21,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:21,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:42:21,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:21,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:21,816 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:21,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 153 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:22,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:22,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 22 [2018-12-03 15:42:22,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:22,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:42:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:42:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:42:22,100 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 23 states. [2018-12-03 15:42:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:22,429 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 15:42:22,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:42:22,429 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-12-03 15:42:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:22,430 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:42:22,430 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:42:22,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 88 SyntacticMatches, 34 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=612, Invalid=1028, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:42:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:42:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2018-12-03 15:42:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:42:22,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 15:42:22,441 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-03 15:42:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:22,441 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 15:42:22,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:42:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 15:42:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:42:22,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:22,442 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1] [2018-12-03 15:42:22,442 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:22,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:22,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1667299850, now seen corresponding path program 33 times [2018-12-03 15:42:22,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:22,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:22,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:23,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:23,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:23,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:23,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:23,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:23,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:23,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:23,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:23,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:23,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:24,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 306 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:24,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:24,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 15:42:24,941 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:24,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:42:24,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:42:24,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1099, Invalid=4303, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:42:24,943 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 74 states. [2018-12-03 15:42:25,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:25,615 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-12-03 15:42:25,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:42:25,615 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 56 [2018-12-03 15:42:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:25,616 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:42:25,616 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:42:25,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 40 SyntacticMatches, 35 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4286 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1666, Invalid=6706, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:42:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:42:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:42:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:42:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-03 15:42:25,628 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-12-03 15:42:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:25,629 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-03 15:42:25,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:42:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-03 15:42:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:42:25,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:25,630 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 1, 1, 1, 1] [2018-12-03 15:42:25,630 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:25,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:25,630 INFO L82 PathProgramCache]: Analyzing trace with hash -751416255, now seen corresponding path program 34 times [2018-12-03 15:42:25,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:25,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:25,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:25,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:26,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:26,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:26,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:26,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:26,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:26,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:26,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:26,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:26,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:26,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 171 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:27,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:27,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 23 [2018-12-03 15:42:27,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:27,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:42:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:42:27,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:42:27,067 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 24 states. [2018-12-03 15:42:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:27,388 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-12-03 15:42:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:42:27,388 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-12-03 15:42:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:27,389 INFO L225 Difference]: With dead ends: 66 [2018-12-03 15:42:27,389 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:42:27,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 36 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=674, Invalid=1132, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:42:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:42:27,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-03 15:42:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:42:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 15:42:27,400 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 57 [2018-12-03 15:42:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:27,400 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 15:42:27,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:42:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 15:42:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:42:27,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:27,401 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1] [2018-12-03 15:42:27,401 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:27,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash -556463013, now seen corresponding path program 35 times [2018-12-03 15:42:27,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:27,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:27,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:27,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:27,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:28,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:28,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:28,035 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:28,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:28,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:28,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:28,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:28,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:28,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:42:28,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:28,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:29,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 342 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:30,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:30,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 15:42:30,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:30,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:42:30,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:42:30,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1217, Invalid=4789, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:42:30,538 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 78 states. [2018-12-03 15:42:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:31,946 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 15:42:31,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:42:31,946 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 59 [2018-12-03 15:42:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:31,947 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:42:31,947 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:42:31,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 42 SyntacticMatches, 37 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4790 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1844, Invalid=7468, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:42:31,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:42:31,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:42:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:42:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 15:42:31,959 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-12-03 15:42:31,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:31,959 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 15:42:31,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:42:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 15:42:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:42:31,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:31,960 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 1, 1, 1, 1] [2018-12-03 15:42:31,960 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:31,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash 138377924, now seen corresponding path program 36 times [2018-12-03 15:42:31,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:31,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:31,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:31,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:31,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:32,347 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:32,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:32,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:32,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:32,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:32,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:32,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:32,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:32,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:32,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:32,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:32,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:32,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 190 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:32,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:32,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 24 [2018-12-03 15:42:32,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:32,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:42:32,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:42:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:42:32,809 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 25 states. [2018-12-03 15:42:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:33,173 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-12-03 15:42:33,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:42:33,174 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-12-03 15:42:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:33,174 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:42:33,174 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:42:33,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 38 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=739, Invalid=1241, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:42:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:42:33,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-12-03 15:42:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:42:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 15:42:33,188 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-03 15:42:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:33,188 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 15:42:33,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:42:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 15:42:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:42:33,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:33,189 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1] [2018-12-03 15:42:33,189 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:33,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash -162748898, now seen corresponding path program 37 times [2018-12-03 15:42:33,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:33,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:33,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:33,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:34,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:34,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:34,069 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:34,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:34,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:34,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:34,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:34,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:34,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:35,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 380 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:35,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:35,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 15:42:35,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:35,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:42:35,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:42:35,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1341, Invalid=5301, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:42:35,782 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 82 states. [2018-12-03 15:42:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:37,348 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-12-03 15:42:37,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:42:37,348 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 62 [2018-12-03 15:42:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:37,349 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:42:37,349 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:42:37,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 44 SyntacticMatches, 39 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5322 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2031, Invalid=8271, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:42:37,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:42:37,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:42:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:42:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-03 15:42:37,360 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-03 15:42:37,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:37,360 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-03 15:42:37,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:42:37,360 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-03 15:42:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:42:37,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:37,361 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 1, 1, 1, 1] [2018-12-03 15:42:37,361 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:37,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1898761451, now seen corresponding path program 38 times [2018-12-03 15:42:37,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:37,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:37,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:37,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:37,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:37,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:37,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:37,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:37,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:37,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:37,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:37,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:38,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:42:38,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:38,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:38,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 210 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:38,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:38,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 25 [2018-12-03 15:42:38,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:38,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:42:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:42:38,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:42:38,480 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 26 states. [2018-12-03 15:42:39,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:39,087 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-12-03 15:42:39,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:42:39,088 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 63 [2018-12-03 15:42:39,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:39,088 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:42:39,089 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:42:39,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 103 SyntacticMatches, 40 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 902 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=807, Invalid=1355, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:42:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:42:39,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-03 15:42:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:42:39,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-03 15:42:39,103 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 63 [2018-12-03 15:42:39,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:39,103 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-03 15:42:39,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:42:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-03 15:42:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:42:39,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:39,104 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1] [2018-12-03 15:42:39,104 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:39,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash 651398703, now seen corresponding path program 39 times [2018-12-03 15:42:39,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:39,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:39,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:39,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:39,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:40,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:40,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:40,061 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:40,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:40,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:40,061 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:40,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:40,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:40,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:40,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:40,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:41,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 420 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:42,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:42,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 15:42:42,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:42,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:42:42,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:42:42,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1471, Invalid=5839, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:42:42,053 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 86 states. [2018-12-03 15:42:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:43,267 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2018-12-03 15:42:43,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:42:43,267 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 65 [2018-12-03 15:42:43,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:43,268 INFO L225 Difference]: With dead ends: 112 [2018-12-03 15:42:43,268 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:42:43,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 46 SyntacticMatches, 41 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5882 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2227, Invalid=9115, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:42:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:42:43,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:42:43,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:42:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 15:42:43,281 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 65 [2018-12-03 15:42:43,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:43,281 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 15:42:43,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:42:43,281 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 15:42:43,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:42:43,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:43,282 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 1, 1, 1, 1] [2018-12-03 15:42:43,282 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:43,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:43,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1197356584, now seen corresponding path program 40 times [2018-12-03 15:42:43,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:43,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:43,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:43,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:44,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:44,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:44,225 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:44,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:44,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:44,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:44,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:44,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:44,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:44,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 231 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:44,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:44,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 26 [2018-12-03 15:42:44,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:44,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:42:44,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:42:44,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:42:44,774 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 27 states. [2018-12-03 15:42:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:45,170 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-03 15:42:45,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:42:45,171 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-12-03 15:42:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:45,171 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:42:45,171 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:42:45,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 108 SyntacticMatches, 42 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=878, Invalid=1474, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:42:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:42:45,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-12-03 15:42:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:42:45,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 15:42:45,188 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 15:42:45,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:45,188 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 15:42:45,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:42:45,188 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 15:42:45,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:42:45,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:45,189 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1] [2018-12-03 15:42:45,189 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:45,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:45,189 INFO L82 PathProgramCache]: Analyzing trace with hash 391610418, now seen corresponding path program 41 times [2018-12-03 15:42:45,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:45,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:45,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:45,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:45,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:45,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:45,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:45,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:45,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:45,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:46,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:42:46,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:46,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:47,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:48,011 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 462 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:48,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:48,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 15:42:48,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:48,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:42:48,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:42:48,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1607, Invalid=6403, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:42:48,031 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 90 states. [2018-12-03 15:42:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:49,970 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 15:42:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:42:49,970 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 68 [2018-12-03 15:42:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:49,971 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:42:49,971 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:42:49,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 48 SyntacticMatches, 43 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6470 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2432, Invalid=10000, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:42:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:42:49,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:42:49,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:42:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-12-03 15:42:49,984 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-12-03 15:42:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:49,984 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-12-03 15:42:49,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:42:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-12-03 15:42:49,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:42:49,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:49,985 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1] [2018-12-03 15:42:49,985 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:49,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:49,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1511507991, now seen corresponding path program 42 times [2018-12-03 15:42:49,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:49,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:49,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:49,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:49,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:50,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:50,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:50,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:50,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:50,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:50,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:50,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:50,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:50,463 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:50,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:50,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:50,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 253 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:50,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:50,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 27 [2018-12-03 15:42:50,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:50,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:42:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:42:50,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:42:50,913 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 28 states. [2018-12-03 15:42:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:51,335 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-12-03 15:42:51,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:42:51,336 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-12-03 15:42:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:51,337 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:42:51,337 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:42:51,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 113 SyntacticMatches, 44 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=952, Invalid=1598, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:42:51,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:42:51,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-12-03 15:42:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:42:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-03 15:42:51,357 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 69 [2018-12-03 15:42:51,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:51,358 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-03 15:42:51,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:42:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-03 15:42:51,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:42:51,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:51,358 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1] [2018-12-03 15:42:51,358 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:51,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:51,359 INFO L82 PathProgramCache]: Analyzing trace with hash -860180989, now seen corresponding path program 43 times [2018-12-03 15:42:51,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:51,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:51,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:51,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:51,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:52,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:52,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:52,238 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:52,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:52,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:52,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:52,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:52,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:42:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:52,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:53,894 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:53,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 506 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:54,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:54,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 15:42:54,900 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:54,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:42:54,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:42:54,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1749, Invalid=6993, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:42:54,902 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 94 states. [2018-12-03 15:42:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:55,805 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-12-03 15:42:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:42:55,805 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 71 [2018-12-03 15:42:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:55,805 INFO L225 Difference]: With dead ends: 122 [2018-12-03 15:42:55,806 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:42:55,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 50 SyntacticMatches, 45 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7086 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2646, Invalid=10926, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 15:42:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:42:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:42:55,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:42:55,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 15:42:55,822 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-12-03 15:42:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:55,822 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 15:42:55,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:42:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 15:42:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:42:55,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:55,822 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 1, 1, 1, 1] [2018-12-03 15:42:55,823 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:55,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1202570988, now seen corresponding path program 44 times [2018-12-03 15:42:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:55,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:55,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:42:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:55,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:56,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:56,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:56,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:56,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:56,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:56,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:56,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:42:56,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:56,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 15:42:56,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:56,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:56,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 276 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:57,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:42:57,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 28 [2018-12-03 15:42:57,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:42:57,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:42:57,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:42:57,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:42:57,036 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 29 states. [2018-12-03 15:42:57,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:42:57,466 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-12-03 15:42:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:42:57,466 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2018-12-03 15:42:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:42:57,467 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:42:57,467 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:42:57,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 118 SyntacticMatches, 46 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1029, Invalid=1727, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:42:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:42:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-03 15:42:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:42:57,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 15:42:57,484 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 15:42:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:42:57,484 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 15:42:57,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:42:57,484 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 15:42:57,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:42:57,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:42:57,485 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1] [2018-12-03 15:42:57,485 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:42:57,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:42:57,485 INFO L82 PathProgramCache]: Analyzing trace with hash 324569158, now seen corresponding path program 45 times [2018-12-03 15:42:57,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:42:57,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:57,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:42:57,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:42:57,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:42:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:42:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:58,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:58,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:42:58,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:42:58,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:42:58,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:42:58,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:42:58,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:42:58,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:42:58,469 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:42:58,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:58,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:01,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 552 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:01,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:01,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 15:43:01,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:01,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 15:43:01,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 15:43:01,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1897, Invalid=7609, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:43:01,971 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 98 states. [2018-12-03 15:43:04,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:04,194 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-12-03 15:43:04,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:43:04,194 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 74 [2018-12-03 15:43:04,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:04,195 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:43:04,195 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:43:04,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 52 SyntacticMatches, 47 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7730 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2869, Invalid=11893, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:43:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:43:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:43:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:43:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-03 15:43:04,210 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-03 15:43:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:04,210 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-03 15:43:04,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 15:43:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-03 15:43:04,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:43:04,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:04,210 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 1, 1, 1, 1] [2018-12-03 15:43:04,210 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:04,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash -623355203, now seen corresponding path program 46 times [2018-12-03 15:43:04,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:04,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:04,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:04,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:04,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:04,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:04,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:04,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:04,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:04,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:04,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:04,629 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:04,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:04,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:04,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 300 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:05,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:05,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 29 [2018-12-03 15:43:05,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:05,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:43:05,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:43:05,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:43:05,311 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 30 states. [2018-12-03 15:43:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:05,782 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-12-03 15:43:05,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:43:05,782 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 75 [2018-12-03 15:43:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:05,783 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:43:05,783 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:43:05,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 123 SyntacticMatches, 48 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1109, Invalid=1861, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:43:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:43:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-12-03 15:43:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:43:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-03 15:43:05,800 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 75 [2018-12-03 15:43:05,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:05,800 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-03 15:43:05,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:43:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-03 15:43:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:43:05,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:05,801 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1] [2018-12-03 15:43:05,801 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:05,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2043843625, now seen corresponding path program 47 times [2018-12-03 15:43:05,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:05,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:05,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:05,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:05,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:06,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:06,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:06,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:06,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:06,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:06,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:06,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:06,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:06,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:43:06,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:06,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:08,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 600 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:09,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:09,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 15:43:09,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:09,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:43:09,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:43:09,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2051, Invalid=8251, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:43:09,450 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 102 states. [2018-12-03 15:43:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:11,128 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 15:43:11,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:43:11,128 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 77 [2018-12-03 15:43:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:11,129 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:43:11,129 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:43:11,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 54 SyntacticMatches, 49 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8402 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3101, Invalid=12901, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 15:43:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:43:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 15:43:11,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:43:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 15:43:11,147 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 77 [2018-12-03 15:43:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:11,147 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 15:43:11,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:43:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 15:43:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:43:11,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:11,148 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 1, 1, 1, 1] [2018-12-03 15:43:11,148 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:11,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:11,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2046456320, now seen corresponding path program 48 times [2018-12-03 15:43:11,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:11,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:11,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:11,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:11,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:11,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:11,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:11,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:11,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:11,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:11,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:11,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:11,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:11,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:11,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:11,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 325 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:12,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:12,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 30 [2018-12-03 15:43:12,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:12,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:43:12,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:43:12,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:43:12,514 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 31 states. [2018-12-03 15:43:13,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:13,020 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-03 15:43:13,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:43:13,021 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 78 [2018-12-03 15:43:13,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:13,021 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:43:13,021 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:43:13,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 128 SyntacticMatches, 50 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1192, Invalid=2000, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:43:13,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:43:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-12-03 15:43:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:43:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 15:43:13,040 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-03 15:43:13,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:13,041 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 15:43:13,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:43:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 15:43:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:43:13,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:13,041 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1] [2018-12-03 15:43:13,042 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:13,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:13,042 INFO L82 PathProgramCache]: Analyzing trace with hash -450445734, now seen corresponding path program 49 times [2018-12-03 15:43:13,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:13,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:13,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:13,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:13,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:14,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:14,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:14,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:14,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:14,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:14,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:14,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:14,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:14,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:16,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 650 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:17,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:17,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 15:43:17,533 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:17,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 15:43:17,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 15:43:17,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=8919, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:43:17,534 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 106 states. [2018-12-03 15:43:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:20,332 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 15:43:20,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:43:20,332 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 80 [2018-12-03 15:43:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:20,333 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:43:20,333 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:43:20,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 56 SyntacticMatches, 51 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9102 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3342, Invalid=13950, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:43:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:43:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:43:20,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:43:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-12-03 15:43:20,354 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-12-03 15:43:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:20,354 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-12-03 15:43:20,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 15:43:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-12-03 15:43:20,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:43:20,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:20,355 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1] [2018-12-03 15:43:20,355 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:20,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:20,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1158060945, now seen corresponding path program 50 times [2018-12-03 15:43:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:20,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:20,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:20,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:20,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:20,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:20,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:20,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:20,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:20,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:20,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:20,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:20,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:21,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:43:21,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:21,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:21,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 351 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:21,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:21,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 31 [2018-12-03 15:43:21,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:21,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:43:21,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:43:21,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:43:21,609 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 32 states. [2018-12-03 15:43:22,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:22,997 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-12-03 15:43:22,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:43:22,998 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 81 [2018-12-03 15:43:22,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:22,999 INFO L225 Difference]: With dead ends: 90 [2018-12-03 15:43:22,999 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:43:23,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 133 SyntacticMatches, 52 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1278, Invalid=2144, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:43:23,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:43:23,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-12-03 15:43:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:43:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-03 15:43:23,018 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 81 [2018-12-03 15:43:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:23,018 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-03 15:43:23,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:43:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-03 15:43:23,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:43:23,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:23,018 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1] [2018-12-03 15:43:23,019 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:23,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash 500090795, now seen corresponding path program 51 times [2018-12-03 15:43:23,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:23,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:23,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:24,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:24,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:24,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:24,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:24,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:24,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:24,384 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:24,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:24,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:24,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:24,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:26,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1053 backedges. 702 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:27,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:27,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 15:43:27,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:27,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 15:43:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 15:43:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2377, Invalid=9613, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:43:27,760 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 110 states. [2018-12-03 15:43:29,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:29,888 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-12-03 15:43:29,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:43:29,888 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 83 [2018-12-03 15:43:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:29,889 INFO L225 Difference]: With dead ends: 142 [2018-12-03 15:43:29,889 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:43:29,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 58 SyntacticMatches, 53 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9830 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3592, Invalid=15040, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:43:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:43:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:43:29,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:43:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 15:43:29,911 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-12-03 15:43:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:29,911 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 15:43:29,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 15:43:29,911 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 15:43:29,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:43:29,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:29,912 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 1, 1, 1, 1] [2018-12-03 15:43:29,912 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:29,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:29,912 INFO L82 PathProgramCache]: Analyzing trace with hash 572443412, now seen corresponding path program 52 times [2018-12-03 15:43:29,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:29,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:29,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:29,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:29,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:31,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:31,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:31,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:31,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:31,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:31,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:31,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:31,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:31,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:31,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:31,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:32,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 378 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:32,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:32,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 32 [2018-12-03 15:43:32,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:32,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:43:32,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:43:32,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:43:32,074 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 33 states. [2018-12-03 15:43:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:32,642 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-12-03 15:43:32,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:43:32,642 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2018-12-03 15:43:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:32,643 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:43:32,643 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:43:32,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 138 SyntacticMatches, 54 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1595 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1367, Invalid=2293, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:43:32,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:43:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2018-12-03 15:43:32,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:43:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 15:43:32,663 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-03 15:43:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:32,663 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 15:43:32,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:43:32,663 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 15:43:32,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:43:32,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:32,664 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1] [2018-12-03 15:43:32,664 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:32,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:32,664 INFO L82 PathProgramCache]: Analyzing trace with hash 362357358, now seen corresponding path program 53 times [2018-12-03 15:43:32,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:32,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:32,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:32,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:32,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:33,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:33,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:33,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:33,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:33,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:33,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:33,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:33,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:33,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:43:33,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:33,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:36,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 756 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:37,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:37,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 15:43:37,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:37,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 15:43:37,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 15:43:37,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=10333, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:43:37,385 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 114 states. [2018-12-03 15:43:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:39,651 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-12-03 15:43:39,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:43:39,651 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 86 [2018-12-03 15:43:39,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:39,652 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:43:39,652 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:43:39,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 60 SyntacticMatches, 55 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10586 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3851, Invalid=16171, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:43:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:43:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 15:43:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:43:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-03 15:43:39,672 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-03 15:43:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:39,673 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-03 15:43:39,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 15:43:39,673 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-03 15:43:39,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:43:39,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:39,674 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 1, 1, 1, 1] [2018-12-03 15:43:39,674 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:39,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:39,674 INFO L82 PathProgramCache]: Analyzing trace with hash -254412187, now seen corresponding path program 54 times [2018-12-03 15:43:39,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:39,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:39,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:39,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:39,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:40,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:40,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:40,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:40,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:40,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:40,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:40,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:40,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:40,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:40,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:40,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:40,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 406 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:41,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:41,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 33 [2018-12-03 15:43:41,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:41,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:43:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:43:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:43:41,499 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 34 states. [2018-12-03 15:43:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:42,079 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2018-12-03 15:43:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:43:42,080 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 87 [2018-12-03 15:43:42,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:42,081 INFO L225 Difference]: With dead ends: 96 [2018-12-03 15:43:42,081 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:43:42,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 143 SyntacticMatches, 56 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1459, Invalid=2447, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:43:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:43:42,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-12-03 15:43:42,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:43:42,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-12-03 15:43:42,106 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 87 [2018-12-03 15:43:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:42,106 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-12-03 15:43:42,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:43:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-12-03 15:43:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:43:42,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:42,106 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1] [2018-12-03 15:43:42,107 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:42,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:42,107 INFO L82 PathProgramCache]: Analyzing trace with hash 323076479, now seen corresponding path program 55 times [2018-12-03 15:43:42,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:42,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:42,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:42,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:43,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:43,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:43,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:43,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:43,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:43,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:43,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:43,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:43,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:46,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:46,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 812 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:47,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:47,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 15:43:47,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:47,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 15:43:47,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 15:43:47,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2727, Invalid=11079, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:43:47,146 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 118 states. [2018-12-03 15:43:50,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:50,188 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-12-03 15:43:50,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:43:50,188 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 89 [2018-12-03 15:43:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:50,189 INFO L225 Difference]: With dead ends: 152 [2018-12-03 15:43:50,189 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:43:50,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 62 SyntacticMatches, 57 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11370 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4119, Invalid=17343, Unknown=0, NotChecked=0, Total=21462 [2018-12-03 15:43:50,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:43:50,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:43:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:43:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 15:43:50,217 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 89 [2018-12-03 15:43:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:50,217 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 15:43:50,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 15:43:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 15:43:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:43:50,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:50,218 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 1, 1, 1, 1] [2018-12-03 15:43:50,218 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:50,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:50,219 INFO L82 PathProgramCache]: Analyzing trace with hash 11653672, now seen corresponding path program 56 times [2018-12-03 15:43:50,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:50,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:50,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:51,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:51,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:51,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:51,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:51,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:51,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:51,262 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:51,263 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:51,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 15:43:51,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:51,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:51,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:51,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:52,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 435 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:52,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:52,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 34 [2018-12-03 15:43:52,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:52,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:43:52,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:43:52,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:43:52,242 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 35 states. [2018-12-03 15:43:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:52,883 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-03 15:43:52,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:43:52,884 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-12-03 15:43:52,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:52,884 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:43:52,884 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:43:52,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 148 SyntacticMatches, 58 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1554, Invalid=2606, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:43:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:43:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-12-03 15:43:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:43:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 15:43:52,908 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 15:43:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:52,908 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 15:43:52,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:43:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 15:43:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 15:43:52,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:52,909 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1] [2018-12-03 15:43:52,909 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:52,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1685670782, now seen corresponding path program 57 times [2018-12-03 15:43:52,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:52,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:52,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:54,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:54,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:54,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:54,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:54,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:54,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:54,295 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:54,295 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:54,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:54,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:54,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:57,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:57,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 870 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:58,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:58,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 15:43:58,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:58,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 15:43:58,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 15:43:58,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2911, Invalid=11851, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:43:58,342 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 122 states. [2018-12-03 15:43:58,962 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:44:01,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:01,335 INFO L93 Difference]: Finished difference Result 157 states and 159 transitions. [2018-12-03 15:44:01,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:44:01,335 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 92 [2018-12-03 15:44:01,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:01,336 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:44:01,336 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:44:01,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 64 SyntacticMatches, 59 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12182 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4396, Invalid=18556, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:44:01,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:44:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 15:44:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:44:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-03 15:44:01,357 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-12-03 15:44:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:01,357 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-03 15:44:01,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 15:44:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-03 15:44:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 15:44:01,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:01,358 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 1, 1, 1, 1] [2018-12-03 15:44:01,358 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:01,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2141812537, now seen corresponding path program 58 times [2018-12-03 15:44:01,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:01,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:01,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:01,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:01,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:01,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:01,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:01,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:01,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:01,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:01,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:01,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:01,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:01,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:01,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 465 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:02,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:02,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 35 [2018-12-03 15:44:02,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:02,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:44:02,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:44:02,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:44:02,652 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 36 states. [2018-12-03 15:44:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:03,269 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-12-03 15:44:03,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:44:03,270 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 93 [2018-12-03 15:44:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:03,270 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:44:03,271 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:44:03,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 153 SyntacticMatches, 60 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1652, Invalid=2770, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:44:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:44:03,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2018-12-03 15:44:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:44:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-03 15:44:03,292 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 93 [2018-12-03 15:44:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:03,293 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-03 15:44:03,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:44:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-03 15:44:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:44:03,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:03,293 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1] [2018-12-03 15:44:03,293 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:03,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 992565587, now seen corresponding path program 59 times [2018-12-03 15:44:03,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:03,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:03,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:03,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:04,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:04,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:04,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:04,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:04,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:04,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:04,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:04,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:04,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 15:44:04,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:04,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:08,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 930 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:09,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:09,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 15:44:09,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:09,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 15:44:09,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 15:44:09,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3101, Invalid=12649, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:44:09,606 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 126 states. [2018-12-03 15:44:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:12,047 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-03 15:44:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:44:12,047 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 95 [2018-12-03 15:44:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:12,048 INFO L225 Difference]: With dead ends: 162 [2018-12-03 15:44:12,048 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:44:12,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 66 SyntacticMatches, 61 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13022 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4682, Invalid=19810, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 15:44:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:44:12,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 15:44:12,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 15:44:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 15:44:12,074 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-12-03 15:44:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:12,075 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 15:44:12,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 15:44:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 15:44:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:44:12,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:12,075 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 1, 1, 1, 1] [2018-12-03 15:44:12,076 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:12,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1538619588, now seen corresponding path program 60 times [2018-12-03 15:44:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:12,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:12,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:12,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:12,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:12,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:12,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:12,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:12,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:12,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:12,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:12,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:12,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:12,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:12,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:12,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:12,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 496 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:13,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:13,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 36 [2018-12-03 15:44:13,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:13,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:44:13,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:44:13,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:44:13,462 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 37 states. [2018-12-03 15:44:14,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:14,154 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-12-03 15:44:14,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:44:14,154 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 96 [2018-12-03 15:44:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:14,154 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:44:14,155 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:44:14,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 158 SyntacticMatches, 62 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1753, Invalid=2939, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:44:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:44:14,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-12-03 15:44:14,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 15:44:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 15:44:14,181 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 15:44:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:14,181 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 15:44:14,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:44:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 15:44:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:44:14,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:14,182 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1] [2018-12-03 15:44:14,182 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:14,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:14,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1144621930, now seen corresponding path program 61 times [2018-12-03 15:44:14,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:14,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:14,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:14,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:14,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:15,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:15,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:15,582 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:15,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:15,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:15,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:15,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:15,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:15,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:18,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 992 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:20,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:20,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 15:44:20,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:20,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 15:44:20,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 15:44:20,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3297, Invalid=13473, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:44:20,359 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 130 states. [2018-12-03 15:44:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:23,232 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-12-03 15:44:23,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:44:23,232 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 98 [2018-12-03 15:44:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:23,232 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:44:23,233 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:44:23,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 68 SyntacticMatches, 63 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13890 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=4977, Invalid=21105, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:44:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:44:23,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:44:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:44:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-03 15:44:23,263 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-03 15:44:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:23,263 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-03 15:44:23,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 15:44:23,263 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-03 15:44:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:44:23,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:23,264 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 1, 1, 1, 1] [2018-12-03 15:44:23,264 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:23,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash -941354483, now seen corresponding path program 62 times [2018-12-03 15:44:23,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:23,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:23,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:23,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:23,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:23,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:23,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:23,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:23,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:23,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:23,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:23,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:23,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:23,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:24,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:44:24,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:24,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:24,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:25,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 528 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:25,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:25,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 37 [2018-12-03 15:44:25,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:25,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:44:25,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:44:25,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:44:25,081 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 38 states. [2018-12-03 15:44:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:25,799 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2018-12-03 15:44:25,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:44:25,800 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 99 [2018-12-03 15:44:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:25,800 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:44:25,800 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:44:25,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 163 SyntacticMatches, 64 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1857, Invalid=3113, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:44:25,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:44:25,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2018-12-03 15:44:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:44:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-12-03 15:44:25,827 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 99 [2018-12-03 15:44:25,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:25,827 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-12-03 15:44:25,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:44:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-12-03 15:44:25,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 15:44:25,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:25,828 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1] [2018-12-03 15:44:25,829 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:25,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:25,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1596493607, now seen corresponding path program 63 times [2018-12-03 15:44:25,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:25,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:25,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:25,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:25,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:27,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:27,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:27,592 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:27,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:27,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:27,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:27,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:27,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:27,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:27,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:27,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:30,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1584 backedges. 1056 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:32,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:32,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 15:44:32,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:32,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 15:44:32,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 15:44:32,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3499, Invalid=14323, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:44:32,378 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 134 states. [2018-12-03 15:44:36,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:36,301 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-12-03 15:44:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:44:36,301 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 101 [2018-12-03 15:44:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:36,302 INFO L225 Difference]: With dead ends: 172 [2018-12-03 15:44:36,302 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:44:36,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 70 SyntacticMatches, 65 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14786 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5281, Invalid=22441, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:44:36,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:44:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 15:44:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 15:44:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 15:44:36,328 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 101 [2018-12-03 15:44:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:36,328 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 15:44:36,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 15:44:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 15:44:36,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:44:36,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:36,329 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 1, 1, 1, 1] [2018-12-03 15:44:36,329 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:36,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1233119824, now seen corresponding path program 64 times [2018-12-03 15:44:36,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:36,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:36,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:36,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:36,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:37,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:37,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:37,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:37,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:37,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:37,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:37,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:37,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:37,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:37,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:37,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:38,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 561 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:38,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:38,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 38 [2018-12-03 15:44:38,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:38,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:44:38,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:44:38,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:44:38,123 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 39 states. [2018-12-03 15:44:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:38,845 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-03 15:44:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:44:38,846 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 102 [2018-12-03 15:44:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:38,846 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:44:38,846 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:44:38,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 168 SyntacticMatches, 66 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2345 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1964, Invalid=3292, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:44:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:44:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-03 15:44:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:44:38,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 15:44:38,874 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-03 15:44:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:38,874 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 15:44:38,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:44:38,875 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 15:44:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:44:38,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:38,875 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1] [2018-12-03 15:44:38,875 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:38,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:38,876 INFO L82 PathProgramCache]: Analyzing trace with hash -382770518, now seen corresponding path program 65 times [2018-12-03 15:44:38,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:38,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:38,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:38,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:40,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:40,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:40,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:40,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:40,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:40,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:40,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:44:40,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:44:40,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:44:40,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:40,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:43,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1683 backedges. 1122 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:45,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:45,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 15:44:45,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:45,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 15:44:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 15:44:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3707, Invalid=15199, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:44:45,251 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 138 states. [2018-12-03 15:44:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:48,958 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-12-03 15:44:48,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:44:48,958 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 104 [2018-12-03 15:44:48,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:48,959 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:44:48,959 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:44:48,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 72 SyntacticMatches, 67 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15710 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5594, Invalid=23818, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:44:48,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:44:48,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 15:44:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:44:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-12-03 15:44:48,987 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-12-03 15:44:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:48,987 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-12-03 15:44:48,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 15:44:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-12-03 15:44:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:44:48,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:48,988 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 1, 1, 1, 1] [2018-12-03 15:44:48,988 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:48,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1961413345, now seen corresponding path program 66 times [2018-12-03 15:44:48,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:48,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:48,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:48,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:49,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:49,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:49,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:49,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:49,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:49,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:49,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:44:49,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:44:49,663 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:44:49,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:44:49,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:49,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 595 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:50,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:50,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 39 [2018-12-03 15:44:50,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:50,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:44:50,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:44:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:44:50,605 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 40 states. [2018-12-03 15:44:51,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:44:51,395 INFO L93 Difference]: Finished difference Result 114 states and 115 transitions. [2018-12-03 15:44:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:44:51,397 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 15:44:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:44:51,398 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:44:51,398 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:44:51,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 173 SyntacticMatches, 68 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2484 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2074, Invalid=3476, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:44:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:44:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2018-12-03 15:44:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:44:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-03 15:44:51,427 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 105 [2018-12-03 15:44:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:44:51,427 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-03 15:44:51,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:44:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-03 15:44:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:44:51,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:44:51,428 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1] [2018-12-03 15:44:51,428 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:44:51,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:44:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash -572366085, now seen corresponding path program 67 times [2018-12-03 15:44:51,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:44:51,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:51,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:44:51,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:44:51,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:44:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:53,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:53,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:44:53,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:44:53,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:44:53,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:44:53,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:44:53,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:44:53,298 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:44:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:44:53,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:44:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:56,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:44:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 1190 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:44:58,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:44:58,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 15:44:58,400 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:44:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 15:44:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 15:44:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3921, Invalid=16101, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:44:58,401 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 142 states. [2018-12-03 15:45:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:01,995 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-12-03 15:45:01,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:45:01,995 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 107 [2018-12-03 15:45:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:01,996 INFO L225 Difference]: With dead ends: 182 [2018-12-03 15:45:01,996 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:45:01,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 74 SyntacticMatches, 69 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16662 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=5916, Invalid=25236, Unknown=0, NotChecked=0, Total=31152 [2018-12-03 15:45:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:45:02,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 15:45:02,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 15:45:02,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 15:45:02,026 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-12-03 15:45:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:02,027 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 15:45:02,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 15:45:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 15:45:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:45:02,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:02,027 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 1, 1, 1, 1] [2018-12-03 15:45:02,027 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:02,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:02,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1159136412, now seen corresponding path program 68 times [2018-12-03 15:45:02,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:02,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:02,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:02,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:02,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:02,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:02,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:02,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:02,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:02,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:02,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:02,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:02,936 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:03,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 15:45:03,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:03,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:03,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 630 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:04,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:04,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 40 [2018-12-03 15:45:04,057 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:04,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:45:04,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:45:04,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:45:04,058 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 41 states. [2018-12-03 15:45:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:04,847 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-12-03 15:45:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:45:04,847 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 108 [2018-12-03 15:45:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:04,848 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:45:04,848 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:45:04,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 178 SyntacticMatches, 70 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2627 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2187, Invalid=3665, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:45:04,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:45:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 111. [2018-12-03 15:45:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:45:04,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 15:45:04,878 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-03 15:45:04,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:04,878 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 15:45:04,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:45:04,878 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 15:45:04,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:45:04,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:04,879 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1] [2018-12-03 15:45:04,879 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:04,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:04,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1533509954, now seen corresponding path program 69 times [2018-12-03 15:45:04,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:04,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:04,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:04,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:04,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:06,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:06,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:06,613 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:06,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:06,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:06,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:06,622 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:06,622 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:06,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:06,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:06,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:10,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:11,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1260 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:11,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:11,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 15:45:11,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:11,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 15:45:11,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 15:45:11,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4141, Invalid=17029, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:45:11,928 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 146 states. [2018-12-03 15:45:16,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:16,746 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-12-03 15:45:16,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:45:16,746 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 110 [2018-12-03 15:45:16,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:16,747 INFO L225 Difference]: With dead ends: 187 [2018-12-03 15:45:16,747 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:45:16,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 76 SyntacticMatches, 71 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17642 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=6247, Invalid=26695, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:45:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:45:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 15:45:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:45:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-03 15:45:16,776 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-03 15:45:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:16,776 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-03 15:45:16,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 15:45:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-03 15:45:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:45:16,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:16,777 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 1, 1, 1, 1] [2018-12-03 15:45:16,777 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:16,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:16,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1491426891, now seen corresponding path program 70 times [2018-12-03 15:45:16,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:16,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:16,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:16,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:17,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:17,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:17,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:17,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:17,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:17,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:17,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:17,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:17,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:17,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 666 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:18,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:18,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 41 [2018-12-03 15:45:18,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:18,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:45:18,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:45:18,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:45:18,852 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 42 states. [2018-12-03 15:45:19,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:19,740 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-12-03 15:45:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:45:19,740 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 15:45:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:19,741 INFO L225 Difference]: With dead ends: 120 [2018-12-03 15:45:19,741 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:45:19,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 183 SyntacticMatches, 72 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2774 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2303, Invalid=3859, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:45:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:45:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2018-12-03 15:45:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:45:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-12-03 15:45:19,775 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 111 [2018-12-03 15:45:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:19,775 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-12-03 15:45:19,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:45:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-12-03 15:45:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:45:19,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:19,776 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1] [2018-12-03 15:45:19,776 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:19,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:19,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1257886927, now seen corresponding path program 71 times [2018-12-03 15:45:19,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:19,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:19,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:19,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:21,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:21,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:21,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:21,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:21,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:21,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:21,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:21,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:21,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:21,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 15:45:21,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:21,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:25,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:27,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1998 backedges. 1332 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:27,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:27,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 15:45:27,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:27,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 15:45:27,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 15:45:27,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4367, Invalid=17983, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:45:27,368 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 150 states. [2018-12-03 15:45:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:31,267 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-12-03 15:45:31,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:45:31,268 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 113 [2018-12-03 15:45:31,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:31,268 INFO L225 Difference]: With dead ends: 192 [2018-12-03 15:45:31,268 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:45:31,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 78 SyntacticMatches, 73 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18650 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=6587, Invalid=28195, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 15:45:31,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:45:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 15:45:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:45:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 15:45:31,301 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 113 [2018-12-03 15:45:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:31,301 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 15:45:31,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 15:45:31,301 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 15:45:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:45:31,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:31,302 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 1, 1, 1, 1] [2018-12-03 15:45:31,302 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:31,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:31,302 INFO L82 PathProgramCache]: Analyzing trace with hash 823966328, now seen corresponding path program 72 times [2018-12-03 15:45:31,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:31,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:31,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:31,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:31,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:31,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:31,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:31,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:31,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:31,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:31,980 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:31,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:32,066 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:32,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:32,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:32,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 703 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:33,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:33,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 42 [2018-12-03 15:45:33,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:33,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:45:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:45:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:45:33,494 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 43 states. [2018-12-03 15:45:34,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:34,376 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-12-03 15:45:34,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:45:34,376 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 114 [2018-12-03 15:45:34,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:34,377 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:45:34,377 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:45:34,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 188 SyntacticMatches, 74 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2925 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2422, Invalid=4058, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 15:45:34,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:45:34,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-12-03 15:45:34,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 15:45:34,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 15:45:34,409 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 15:45:34,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:34,409 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 15:45:34,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:45:34,409 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 15:45:34,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 15:45:34,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:34,410 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1] [2018-12-03 15:45:34,410 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:34,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:34,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1557711058, now seen corresponding path program 73 times [2018-12-03 15:45:34,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:34,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:34,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:34,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:36,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:36,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:36,384 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:36,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:36,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:36,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:36,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:36,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:45:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:36,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:40,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2109 backedges. 1406 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:42,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:42,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 15:45:42,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:42,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-03 15:45:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-03 15:45:42,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4599, Invalid=18963, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:45:42,461 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 154 states. [2018-12-03 15:45:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:46,108 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 15:45:46,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:45:46,108 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 116 [2018-12-03 15:45:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:46,109 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:45:46,109 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:45:46,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 80 SyntacticMatches, 75 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19686 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=6936, Invalid=29736, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:45:46,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:45:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 15:45:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:45:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-12-03 15:45:46,141 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-12-03 15:45:46,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:46,141 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-12-03 15:45:46,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-03 15:45:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-12-03 15:45:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 15:45:46,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:46,142 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 1, 1, 1, 1] [2018-12-03 15:45:46,142 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:46,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:46,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1814260087, now seen corresponding path program 74 times [2018-12-03 15:45:46,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:46,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:45:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:46,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:47,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:47,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:47,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:47,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:47,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:47,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:47,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:45:47,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:45:47,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:45:47,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:47,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:47,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 741 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:48,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:48,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 43 [2018-12-03 15:45:48,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:48,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:45:48,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:45:48,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:45:48,513 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 44 states. [2018-12-03 15:45:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:45:49,410 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2018-12-03 15:45:49,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:45:49,410 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 117 [2018-12-03 15:45:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:45:49,411 INFO L225 Difference]: With dead ends: 126 [2018-12-03 15:45:49,411 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:45:49,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 193 SyntacticMatches, 76 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2544, Invalid=4262, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:45:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:45:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-12-03 15:45:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:45:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-12-03 15:45:49,445 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 117 [2018-12-03 15:45:49,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:45:49,445 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-12-03 15:45:49,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:45:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-12-03 15:45:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:45:49,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:45:49,446 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1] [2018-12-03 15:45:49,446 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:45:49,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:45:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 252830883, now seen corresponding path program 75 times [2018-12-03 15:45:49,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:45:49,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:49,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:45:49,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:45:49,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:45:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:45:51,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:51,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:51,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:45:51,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:45:51,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:45:51,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:45:51,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:45:51,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:45:51,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:45:51,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:45:51,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:45:51,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:45:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:55,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:45:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 1482 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:45:57,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:45:57,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 15:45:57,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:45:57,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-03 15:45:57,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-03 15:45:57,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4837, Invalid=19969, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:45:57,583 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 158 states. [2018-12-03 15:46:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:01,880 INFO L93 Difference]: Finished difference Result 202 states and 204 transitions. [2018-12-03 15:46:01,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:46:01,880 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 119 [2018-12-03 15:46:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:01,880 INFO L225 Difference]: With dead ends: 202 [2018-12-03 15:46:01,880 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:46:01,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 82 SyntacticMatches, 77 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20750 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=7294, Invalid=31318, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 15:46:01,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:46:01,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 15:46:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 15:46:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 15:46:01,915 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 119 [2018-12-03 15:46:01,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:01,916 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 15:46:01,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-03 15:46:01,916 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 15:46:01,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 15:46:01,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:01,916 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 1, 1, 1, 1] [2018-12-03 15:46:01,917 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:01,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash 850536332, now seen corresponding path program 76 times [2018-12-03 15:46:01,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:01,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:01,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:01,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:01,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:02,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:02,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:02,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:02,670 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:02,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:02,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:02,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:02,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:02,679 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:02,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:02,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:04,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 780 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:04,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:04,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 44 [2018-12-03 15:46:04,327 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:04,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:46:04,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:46:04,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:46:04,328 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 45 states. [2018-12-03 15:46:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:05,256 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-12-03 15:46:05,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:46:05,256 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 120 [2018-12-03 15:46:05,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:05,257 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:46:05,257 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:46:05,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 198 SyntacticMatches, 78 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3239 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2669, Invalid=4471, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:46:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:46:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-12-03 15:46:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 15:46:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 15:46:05,293 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 15:46:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:05,293 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 15:46:05,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:46:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 15:46:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:46:05,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:05,294 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1] [2018-12-03 15:46:05,294 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:05,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1321681126, now seen corresponding path program 77 times [2018-12-03 15:46:05,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:05,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:05,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:05,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:07,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:07,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:07,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:07,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:07,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:07,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:07,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:07,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:07,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 15:46:07,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:07,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:11,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2340 backedges. 1560 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:14,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:14,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 15:46:14,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:14,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 15:46:14,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 15:46:14,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5081, Invalid=21001, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:46:14,248 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 162 states. [2018-12-03 15:46:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:20,150 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-12-03 15:46:20,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:46:20,150 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 122 [2018-12-03 15:46:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:20,151 INFO L225 Difference]: With dead ends: 207 [2018-12-03 15:46:20,151 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:46:20,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 84 SyntacticMatches, 79 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21842 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=7661, Invalid=32941, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:46:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:46:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:46:20,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:46:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-12-03 15:46:20,187 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-12-03 15:46:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:20,187 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-12-03 15:46:20,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 15:46:20,188 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-12-03 15:46:20,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:46:20,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:20,188 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 1, 1, 1, 1] [2018-12-03 15:46:20,188 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:20,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:20,189 INFO L82 PathProgramCache]: Analyzing trace with hash 630303069, now seen corresponding path program 78 times [2018-12-03 15:46:20,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:20,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:20,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:20,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:20,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:20,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:20,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:20,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:20,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:20,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:21,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:21,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:21,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:21,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:21,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:21,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 820 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:22,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:22,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 45 [2018-12-03 15:46:22,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:22,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:46:22,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:46:22,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=951, Invalid=1119, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:46:22,388 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 46 states. [2018-12-03 15:46:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:23,385 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-12-03 15:46:23,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:46:23,385 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 123 [2018-12-03 15:46:23,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:23,386 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:46:23,386 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:46:23,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 203 SyntacticMatches, 80 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2797, Invalid=4685, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 15:46:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:46:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-12-03 15:46:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 15:46:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-12-03 15:46:23,439 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 123 [2018-12-03 15:46:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:23,440 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-12-03 15:46:23,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:46:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-12-03 15:46:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 15:46:23,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:23,441 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1] [2018-12-03 15:46:23,441 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:23,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash 130912887, now seen corresponding path program 79 times [2018-12-03 15:46:23,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:23,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:23,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:25,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:25,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:25,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:25,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:25,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:25,991 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:26,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:26,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:26,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:30,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 1640 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 15:46:32,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:32,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-03 15:46:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-03 15:46:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5331, Invalid=22059, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:46:32,884 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 166 states. [2018-12-03 15:46:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:38,107 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 15:46:38,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:46:38,108 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 125 [2018-12-03 15:46:38,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:38,108 INFO L225 Difference]: With dead ends: 212 [2018-12-03 15:46:38,108 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:46:38,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 86 SyntacticMatches, 81 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22962 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=8037, Invalid=34605, Unknown=0, NotChecked=0, Total=42642 [2018-12-03 15:46:38,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:46:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 15:46:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 15:46:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 15:46:38,156 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 125 [2018-12-03 15:46:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:38,156 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 15:46:38,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-03 15:46:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 15:46:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 15:46:38,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:38,157 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 1, 1, 1, 1] [2018-12-03 15:46:38,157 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:38,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:38,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1950368416, now seen corresponding path program 80 times [2018-12-03 15:46:38,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:38,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:38,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:38,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:38,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:38,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:38,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:38,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:38,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:38,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:39,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:39,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:39,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 15:46:39,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:39,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:39,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:39,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:40,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 861 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:40,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:40,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 46 [2018-12-03 15:46:40,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:40,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:46:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:46:40,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:46:40,799 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 47 states. [2018-12-03 15:46:41,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:41,841 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-12-03 15:46:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:46:41,841 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 126 [2018-12-03 15:46:41,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:41,842 INFO L225 Difference]: With dead ends: 135 [2018-12-03 15:46:41,842 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:46:41,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 208 SyntacticMatches, 82 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3569 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2928, Invalid=4904, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:46:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:46:41,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2018-12-03 15:46:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 15:46:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 15:46:41,886 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-03 15:46:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:41,886 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 15:46:41,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:46:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 15:46:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:46:41,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:41,887 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1] [2018-12-03 15:46:41,887 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:41,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1698359034, now seen corresponding path program 81 times [2018-12-03 15:46:41,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:41,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:41,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:41,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:44,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:44,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:44,190 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:44,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:44,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:44,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:44,199 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:44,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:44,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:44,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:44,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:49,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2583 backedges. 1722 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:51,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:51,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 15:46:51,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:51,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-03 15:46:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-03 15:46:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5587, Invalid=23143, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:46:51,646 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 170 states. [2018-12-03 15:46:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:56,096 INFO L93 Difference]: Finished difference Result 217 states and 219 transitions. [2018-12-03 15:46:56,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:46:56,096 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 128 [2018-12-03 15:46:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:56,097 INFO L225 Difference]: With dead ends: 217 [2018-12-03 15:46:56,097 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:46:56,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 88 SyntacticMatches, 83 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24110 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=8422, Invalid=36310, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 15:46:56,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:46:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 15:46:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:46:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-12-03 15:46:56,143 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-12-03 15:46:56,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:56,143 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-12-03 15:46:56,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-03 15:46:56,143 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-12-03 15:46:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:46:56,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:56,144 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 1, 1, 1, 1] [2018-12-03 15:46:56,144 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:56,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:56,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1684219343, now seen corresponding path program 82 times [2018-12-03 15:46:56,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:56,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:56,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:56,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:56,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:57,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:57,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:57,082 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:57,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:57,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:57,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:57,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:57,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:57,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:57,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 903 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:58,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:58,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 47 [2018-12-03 15:46:58,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:58,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:46:58,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:46:58,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1040, Invalid=1216, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:46:58,612 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 48 states. [2018-12-03 15:46:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:59,625 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-12-03 15:46:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:46:59,625 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 129 [2018-12-03 15:46:59,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:59,626 INFO L225 Difference]: With dead ends: 138 [2018-12-03 15:46:59,626 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:46:59,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 213 SyntacticMatches, 84 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3062, Invalid=5128, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:46:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:46:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2018-12-03 15:46:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:46:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-12-03 15:46:59,666 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 129 [2018-12-03 15:46:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:59,666 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-12-03 15:46:59,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:46:59,666 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-12-03 15:46:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 15:46:59,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:59,667 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1] [2018-12-03 15:46:59,667 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:59,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash 667934283, now seen corresponding path program 83 times [2018-12-03 15:46:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:59,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:59,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:02,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:02,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:02,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:02,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:02,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:02,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:02,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:02,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:02,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 15:47:02,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:02,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:07,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2709 backedges. 1806 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:09,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:09,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 15:47:09,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:09,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 15:47:09,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 15:47:09,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5849, Invalid=24253, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:47:09,903 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 174 states. [2018-12-03 15:47:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:15,464 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-12-03 15:47:15,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:47:15,465 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 131 [2018-12-03 15:47:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:15,465 INFO L225 Difference]: With dead ends: 222 [2018-12-03 15:47:15,465 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:47:15,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 90 SyntacticMatches, 85 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25286 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=8816, Invalid=38056, Unknown=0, NotChecked=0, Total=46872 [2018-12-03 15:47:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:47:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 15:47:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 15:47:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 15:47:15,506 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 131 [2018-12-03 15:47:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:15,506 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 15:47:15,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 15:47:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 15:47:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 15:47:15,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:15,507 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 1, 1, 1, 1] [2018-12-03 15:47:15,507 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:15,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1201796172, now seen corresponding path program 84 times [2018-12-03 15:47:15,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:15,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:15,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:15,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:16,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:16,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:16,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:16,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:16,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:16,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:16,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:16,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:16,487 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:16,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:16,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:16,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:16,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 946 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:17,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:17,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 48 [2018-12-03 15:47:17,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:17,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:47:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:47:17,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:47:17,955 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 49 states. [2018-12-03 15:47:19,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:19,002 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-12-03 15:47:19,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:47:19,002 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 132 [2018-12-03 15:47:19,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:19,003 INFO L225 Difference]: With dead ends: 141 [2018-12-03 15:47:19,003 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:47:19,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 218 SyntacticMatches, 86 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3915 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3199, Invalid=5357, Unknown=0, NotChecked=0, Total=8556 [2018-12-03 15:47:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:47:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-03 15:47:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 15:47:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 15:47:19,045 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-03 15:47:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:19,045 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 15:47:19,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:47:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 15:47:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 15:47:19,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:19,047 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1] [2018-12-03 15:47:19,047 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:19,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:19,047 INFO L82 PathProgramCache]: Analyzing trace with hash 420133646, now seen corresponding path program 85 times [2018-12-03 15:47:19,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:19,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:19,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:19,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:19,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:21,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:21,880 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:21,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:21,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:21,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:21,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:21,889 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:21,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:27,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:27,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2838 backedges. 1892 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 15:47:29,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:29,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-03 15:47:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-03 15:47:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6117, Invalid=25389, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:47:29,665 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 178 states. [2018-12-03 15:47:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:33,886 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-12-03 15:47:33,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:47:33,886 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 134 [2018-12-03 15:47:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:33,887 INFO L225 Difference]: With dead ends: 227 [2018-12-03 15:47:33,887 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:47:33,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 92 SyntacticMatches, 87 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26490 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=9219, Invalid=39843, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 15:47:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:47:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 15:47:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:47:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-12-03 15:47:33,927 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-12-03 15:47:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:33,927 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-12-03 15:47:33,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-03 15:47:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-12-03 15:47:33,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:47:33,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:33,928 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 1, 1, 1, 1] [2018-12-03 15:47:33,928 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:33,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:33,928 INFO L82 PathProgramCache]: Analyzing trace with hash 711010565, now seen corresponding path program 86 times [2018-12-03 15:47:33,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:33,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:33,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:34,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:34,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:34,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:34,822 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:34,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:34,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:34,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:34,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:34,831 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:35,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 15:47:35,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:35,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:35,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:36,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 990 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:36,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:36,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 49 [2018-12-03 15:47:36,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:36,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:47:36,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:47:36,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:47:36,837 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 50 states. [2018-12-03 15:47:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:37,916 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-12-03 15:47:37,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:47:37,917 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 135 [2018-12-03 15:47:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:37,918 INFO L225 Difference]: With dead ends: 144 [2018-12-03 15:47:37,918 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 15:47:37,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 223 SyntacticMatches, 88 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3339, Invalid=5591, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:47:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 15:47:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2018-12-03 15:47:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 15:47:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-12-03 15:47:37,968 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 135 [2018-12-03 15:47:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:37,968 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-12-03 15:47:37,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:47:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-12-03 15:47:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 15:47:37,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:37,969 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1] [2018-12-03 15:47:37,969 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:37,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash 381405215, now seen corresponding path program 87 times [2018-12-03 15:47:37,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:37,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:37,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:37,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:37,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:40,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:40,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:40,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:40,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:40,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:40,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:40,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:40,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:40,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:40,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:40,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:46,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 1980 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:48,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:48,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 15:47:48,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:48,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-03 15:47:48,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-03 15:47:48,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6391, Invalid=26551, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:47:48,918 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 182 states. [2018-12-03 15:47:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:52,838 INFO L93 Difference]: Finished difference Result 232 states and 234 transitions. [2018-12-03 15:47:52,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 15:47:52,838 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 137 [2018-12-03 15:47:52,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:52,838 INFO L225 Difference]: With dead ends: 232 [2018-12-03 15:47:52,838 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:47:52,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 94 SyntacticMatches, 89 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27722 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=9631, Invalid=41671, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 15:47:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:47:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 15:47:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 15:47:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 15:47:52,887 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 137 [2018-12-03 15:47:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:52,887 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 15:47:52,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-03 15:47:52,887 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 15:47:52,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 15:47:52,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:52,888 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 1, 1, 1, 1] [2018-12-03 15:47:52,888 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:52,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1348304184, now seen corresponding path program 88 times [2018-12-03 15:47:52,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:52,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:52,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:53,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:53,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:53,873 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:53,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:53,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:53,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:53,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:53,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:53,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:54,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 1035 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:55,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:55,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 50 [2018-12-03 15:47:55,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:55,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:47:55,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:47:55,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 15:47:55,617 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 51 states. [2018-12-03 15:47:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:57,002 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-12-03 15:47:57,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:47:57,002 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 138 [2018-12-03 15:47:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:57,003 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:47:57,003 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 15:47:57,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 228 SyntacticMatches, 90 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4277 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3482, Invalid=5830, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:47:57,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 15:47:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-12-03 15:47:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 15:47:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 15:47:57,054 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 15:47:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:57,054 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 15:47:57,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:47:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 15:47:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 15:47:57,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:57,055 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1] [2018-12-03 15:47:57,056 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:57,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:57,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1359854882, now seen corresponding path program 89 times [2018-12-03 15:47:57,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:57,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:57,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:57,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:57,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:59,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:59,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:59,808 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:59,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:59,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:59,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:47:59,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:59,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:00,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 15:48:00,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:00,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:05,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3105 backedges. 2070 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:08,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:08,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 15:48:08,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:08,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 15:48:08,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 15:48:08,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6671, Invalid=27739, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:48:08,623 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 186 states. [2018-12-03 15:48:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:13,325 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-12-03 15:48:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:48:13,325 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 140 [2018-12-03 15:48:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:13,326 INFO L225 Difference]: With dead ends: 237 [2018-12-03 15:48:13,326 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 15:48:13,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 96 SyntacticMatches, 91 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28982 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=10052, Invalid=43540, Unknown=0, NotChecked=0, Total=53592 [2018-12-03 15:48:13,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 15:48:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 15:48:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 15:48:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-12-03 15:48:13,371 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-12-03 15:48:13,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:13,371 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-12-03 15:48:13,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 15:48:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-12-03 15:48:13,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 15:48:13,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:13,372 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1] [2018-12-03 15:48:13,372 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:13,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:13,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1690200615, now seen corresponding path program 90 times [2018-12-03 15:48:13,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:13,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:13,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:13,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:13,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:14,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:14,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:14,414 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:14,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:14,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:14,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:14,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:14,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:14,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:14,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:14,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:14,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 1081 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:16,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:16,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 51 [2018-12-03 15:48:16,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:16,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:48:16,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:48:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:48:16,185 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 52 states. [2018-12-03 15:48:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:17,513 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2018-12-03 15:48:17,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:48:17,514 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 141 [2018-12-03 15:48:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:17,515 INFO L225 Difference]: With dead ends: 150 [2018-12-03 15:48:17,515 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:48:17,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 233 SyntacticMatches, 92 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3628, Invalid=6074, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 15:48:17,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:48:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2018-12-03 15:48:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 15:48:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-12-03 15:48:17,559 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 141 [2018-12-03 15:48:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:17,559 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-12-03 15:48:17,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:48:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-12-03 15:48:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 15:48:17,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:17,560 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1] [2018-12-03 15:48:17,560 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:17,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:17,560 INFO L82 PathProgramCache]: Analyzing trace with hash -785100813, now seen corresponding path program 91 times [2018-12-03 15:48:17,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:17,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:17,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:17,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:20,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:20,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:20,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:20,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:20,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:20,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:20,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:20,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:20,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:26,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:29,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3243 backedges. 2162 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:29,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:29,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 15:48:29,382 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:29,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-03 15:48:29,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-03 15:48:29,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6957, Invalid=28953, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:48:29,384 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 190 states. [2018-12-03 15:48:35,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:35,809 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-12-03 15:48:35,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:48:35,809 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 143 [2018-12-03 15:48:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:35,810 INFO L225 Difference]: With dead ends: 242 [2018-12-03 15:48:35,810 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 15:48:35,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 98 SyntacticMatches, 93 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30270 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=10482, Invalid=45450, Unknown=0, NotChecked=0, Total=55932 [2018-12-03 15:48:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 15:48:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 15:48:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 15:48:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 15:48:35,857 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 143 [2018-12-03 15:48:35,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:35,858 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 15:48:35,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-03 15:48:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 15:48:35,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 15:48:35,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:35,858 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 1, 1, 1, 1] [2018-12-03 15:48:35,859 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:35,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:35,859 INFO L82 PathProgramCache]: Analyzing trace with hash -660297764, now seen corresponding path program 92 times [2018-12-03 15:48:35,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:35,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:35,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:35,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:35,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:36,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:36,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:36,884 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:36,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:36,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:36,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:36,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:36,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:37,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 15:48:37,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:37,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:37,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:39,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 1128 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:39,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:39,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 52 [2018-12-03 15:48:39,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:39,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:48:39,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:48:39,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:48:39,076 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 53 states. [2018-12-03 15:48:40,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:40,282 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-12-03 15:48:40,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:48:40,283 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 144 [2018-12-03 15:48:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:40,284 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:48:40,284 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:48:40,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 238 SyntacticMatches, 94 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4655 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3777, Invalid=6323, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:48:40,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:48:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2018-12-03 15:48:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:48:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 15:48:40,331 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 15:48:40,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:40,331 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 15:48:40,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:48:40,331 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 15:48:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:48:40,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:40,332 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1] [2018-12-03 15:48:40,332 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:40,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:40,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1109060918, now seen corresponding path program 93 times [2018-12-03 15:48:40,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:40,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:40,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:43,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:43,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:43,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:43,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:43,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:43,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:43,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:43,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:43,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:43,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:43,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:43,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:49,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:52,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3384 backedges. 2256 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:52,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:52,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 15:48:52,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:52,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-03 15:48:52,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-03 15:48:52,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7249, Invalid=30193, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:48:52,996 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 194 states. [2018-12-03 15:48:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:58,670 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-12-03 15:48:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 15:48:58,670 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 146 [2018-12-03 15:48:58,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:58,671 INFO L225 Difference]: With dead ends: 247 [2018-12-03 15:48:58,671 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:48:58,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 100 SyntacticMatches, 95 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31586 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=10921, Invalid=47401, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 15:48:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:48:58,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 15:48:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 15:48:58,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-12-03 15:48:58,720 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-12-03 15:48:58,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:58,720 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-12-03 15:48:58,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-03 15:48:58,720 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-12-03 15:48:58,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 15:48:58,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:58,721 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 1, 1, 1, 1] [2018-12-03 15:48:58,721 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:58,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:58,721 INFO L82 PathProgramCache]: Analyzing trace with hash -324984659, now seen corresponding path program 94 times [2018-12-03 15:48:58,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:58,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:58,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:58,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:59,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:59,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:59,812 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:59,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:59,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:59,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:48:59,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:59,821 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:59,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:00,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 1176 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:01,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 53 [2018-12-03 15:49:01,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:01,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:49:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:49:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:49:01,688 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 54 states. [2018-12-03 15:49:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:03,254 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-12-03 15:49:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:49:03,255 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 147 [2018-12-03 15:49:03,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:03,256 INFO L225 Difference]: With dead ends: 156 [2018-12-03 15:49:03,256 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:49:03,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 243 SyntacticMatches, 96 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4850 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3929, Invalid=6577, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:49:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:49:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-12-03 15:49:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 15:49:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-12-03 15:49:03,308 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 147 [2018-12-03 15:49:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:03,309 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-12-03 15:49:03,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:49:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-12-03 15:49:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 15:49:03,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:03,310 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1] [2018-12-03 15:49:03,310 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:03,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:03,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1222407623, now seen corresponding path program 95 times [2018-12-03 15:49:03,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:03,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:03,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:03,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:06,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:06,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:06,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:06,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:06,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:06,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:06,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:06,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:49:06,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:06,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 2352 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:16,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:16,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 15:49:16,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:16,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-03 15:49:16,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-03 15:49:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7547, Invalid=31459, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:49:16,353 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 198 states. [2018-12-03 15:49:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:22,254 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-12-03 15:49:22,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 15:49:22,254 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 149 [2018-12-03 15:49:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:22,255 INFO L225 Difference]: With dead ends: 252 [2018-12-03 15:49:22,255 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:49:22,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 102 SyntacticMatches, 97 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32930 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=11369, Invalid=49393, Unknown=0, NotChecked=0, Total=60762 [2018-12-03 15:49:22,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:49:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 15:49:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 15:49:22,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 15:49:22,306 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 149 [2018-12-03 15:49:22,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:22,306 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 15:49:22,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-03 15:49:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 15:49:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 15:49:22,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:22,307 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 1, 1, 1, 1] [2018-12-03 15:49:22,307 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:22,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1610316528, now seen corresponding path program 96 times [2018-12-03 15:49:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:22,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:22,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:23,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:23,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:23,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:23,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:23,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:23,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:23,776 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:23,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:23,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:23,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:23,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:23,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:23,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 1225 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:25,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:25,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 54 [2018-12-03 15:49:25,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:25,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:49:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:49:25,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:49:25,741 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 55 states. [2018-12-03 15:49:27,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:27,037 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-12-03 15:49:27,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:49:27,037 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 150 [2018-12-03 15:49:27,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:27,038 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:49:27,038 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:49:27,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 248 SyntacticMatches, 98 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5049 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4084, Invalid=6836, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 15:49:27,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:49:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2018-12-03 15:49:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 15:49:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 15:49:27,090 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-03 15:49:27,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:27,090 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 15:49:27,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:49:27,090 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 15:49:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 15:49:27,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:27,091 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1] [2018-12-03 15:49:27,091 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:27,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:27,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1326009162, now seen corresponding path program 97 times [2018-12-03 15:49:27,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:27,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:27,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:27,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:27,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:30,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:30,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:30,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:30,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:30,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:30,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:30,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:30,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:30,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:30,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:37,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3675 backedges. 2450 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:40,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:40,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 15:49:40,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:40,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-12-03 15:49:40,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-12-03 15:49:40,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7851, Invalid=32751, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:49:40,778 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 202 states. [2018-12-03 15:49:48,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:48,132 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-12-03 15:49:48,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:49:48,132 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 152 [2018-12-03 15:49:48,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:48,133 INFO L225 Difference]: With dead ends: 257 [2018-12-03 15:49:48,133 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:49:48,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 104 SyntacticMatches, 99 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34302 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=11826, Invalid=51426, Unknown=0, NotChecked=0, Total=63252 [2018-12-03 15:49:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:49:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 15:49:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 15:49:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-12-03 15:49:48,205 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-12-03 15:49:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:48,205 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-12-03 15:49:48,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-12-03 15:49:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-12-03 15:49:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 15:49:48,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:48,206 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 1, 1, 1, 1] [2018-12-03 15:49:48,206 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:48,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:48,206 INFO L82 PathProgramCache]: Analyzing trace with hash -236795519, now seen corresponding path program 98 times [2018-12-03 15:49:48,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:48,207 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:49,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:49,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:49,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:49,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:49,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:49,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:49,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:49,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:49,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 15:49:49,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:49,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:50,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 1275 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:51,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:51,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 55 [2018-12-03 15:49:51,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:51,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:49:51,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:49:51,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=1644, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:49:51,854 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 56 states. [2018-12-03 15:49:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:53,228 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-12-03 15:49:53,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 15:49:53,228 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 153 [2018-12-03 15:49:53,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:53,229 INFO L225 Difference]: With dead ends: 162 [2018-12-03 15:49:53,229 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:49:53,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 253 SyntacticMatches, 100 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5252 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4242, Invalid=7100, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:49:53,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:49:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2018-12-03 15:49:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 15:49:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-12-03 15:49:53,284 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 153 [2018-12-03 15:49:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:53,284 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-12-03 15:49:53,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:49:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-12-03 15:49:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 15:49:53,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:53,285 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1] [2018-12-03 15:49:53,285 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:53,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash 72825243, now seen corresponding path program 99 times [2018-12-03 15:49:53,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:53,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:53,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:56,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:56,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:56,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:56,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:56,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:56,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:56,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:56,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:56,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:56,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:56,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:03,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:03,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3825 backedges. 2550 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:07,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:07,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 15:50:07,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:07,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-12-03 15:50:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-12-03 15:50:07,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8161, Invalid=34069, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:50:07,294 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 206 states. [2018-12-03 15:50:11,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:11,876 INFO L93 Difference]: Finished difference Result 262 states and 264 transitions. [2018-12-03 15:50:11,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 15:50:11,876 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 155 [2018-12-03 15:50:11,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:11,877 INFO L225 Difference]: With dead ends: 262 [2018-12-03 15:50:11,877 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 15:50:11,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 106 SyntacticMatches, 101 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35702 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=12292, Invalid=53500, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 15:50:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 15:50:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 15:50:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 15:50:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 15:50:11,932 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 155 [2018-12-03 15:50:11,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:11,932 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 15:50:11,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-12-03 15:50:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 15:50:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 15:50:11,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:11,933 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 1, 1, 1, 1] [2018-12-03 15:50:11,933 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:11,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:11,934 INFO L82 PathProgramCache]: Analyzing trace with hash 4062212, now seen corresponding path program 100 times [2018-12-03 15:50:11,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:11,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:11,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:11,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:11,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:13,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:13,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:13,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:13,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:13,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:13,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:13,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:13,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:13,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:13,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 1326 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:15,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:15,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 56 [2018-12-03 15:50:15,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:15,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:50:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:50:15,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 15:50:15,611 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 57 states. [2018-12-03 15:50:17,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:17,016 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-12-03 15:50:17,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 15:50:17,016 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 156 [2018-12-03 15:50:17,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:17,017 INFO L225 Difference]: With dead ends: 165 [2018-12-03 15:50:17,018 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:50:17,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 258 SyntacticMatches, 102 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5459 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4403, Invalid=7369, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 15:50:17,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:50:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2018-12-03 15:50:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 15:50:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 15:50:17,077 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-03 15:50:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:17,077 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 15:50:17,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:50:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 15:50:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 15:50:17,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:17,077 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1, 1] [2018-12-03 15:50:17,078 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:17,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash -391129250, now seen corresponding path program 101 times [2018-12-03 15:50:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:17,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:17,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:17,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:20,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:20,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:20,756 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:20,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:20,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:20,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:20,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:20,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:21,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 15:50:21,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:21,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:28,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 2652 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:31,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:31,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 15:50:31,788 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:31,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-12-03 15:50:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-12-03 15:50:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8477, Invalid=35413, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 15:50:31,791 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 210 states. [2018-12-03 15:50:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:37,107 INFO L93 Difference]: Finished difference Result 267 states and 269 transitions. [2018-12-03 15:50:37,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 15:50:37,107 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 158 [2018-12-03 15:50:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:37,108 INFO L225 Difference]: With dead ends: 267 [2018-12-03 15:50:37,108 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:50:37,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 108 SyntacticMatches, 103 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37130 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=12767, Invalid=55615, Unknown=0, NotChecked=0, Total=68382 [2018-12-03 15:50:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:50:37,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 15:50:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 15:50:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-12-03 15:50:37,167 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-12-03 15:50:37,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:37,167 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-12-03 15:50:37,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-12-03 15:50:37,167 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-12-03 15:50:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 15:50:37,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:37,168 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 1, 1, 1, 1] [2018-12-03 15:50:37,168 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:37,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:37,168 INFO L82 PathProgramCache]: Analyzing trace with hash -211185579, now seen corresponding path program 102 times [2018-12-03 15:50:37,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:37,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:37,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:37,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:37,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:37,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:38,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:38,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:38,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:38,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:38,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:38,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:38,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:38,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:38,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:38,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:38,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:38,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 1378 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:40,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:40,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 57 [2018-12-03 15:50:40,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:40,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:50:40,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:50:40,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1545, Invalid=1761, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:50:40,856 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 58 states. [2018-12-03 15:50:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:42,247 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2018-12-03 15:50:42,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 15:50:42,247 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 159 [2018-12-03 15:50:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:42,248 INFO L225 Difference]: With dead ends: 168 [2018-12-03 15:50:42,248 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:50:42,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 263 SyntacticMatches, 104 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4567, Invalid=7643, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 15:50:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:50:42,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2018-12-03 15:50:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 15:50:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-12-03 15:50:42,316 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 159 [2018-12-03 15:50:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:42,316 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-12-03 15:50:42,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:50:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-12-03 15:50:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 15:50:42,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:42,317 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1, 1] [2018-12-03 15:50:42,317 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:42,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:42,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1085826193, now seen corresponding path program 103 times [2018-12-03 15:50:42,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:42,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:42,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:42,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:46,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:46,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:46,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:46,244 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:46,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:46,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:46,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:46,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:46,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:46,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:53,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 2756 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:57,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:57,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 15:50:57,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:57,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-12-03 15:50:57,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-12-03 15:50:57,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8799, Invalid=36783, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 15:50:57,774 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 214 states. [2018-12-03 15:51:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:02,779 INFO L93 Difference]: Finished difference Result 272 states and 274 transitions. [2018-12-03 15:51:02,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 15:51:02,779 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 161 [2018-12-03 15:51:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:02,780 INFO L225 Difference]: With dead ends: 272 [2018-12-03 15:51:02,780 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:51:02,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 110 SyntacticMatches, 105 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38586 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=13251, Invalid=57771, Unknown=0, NotChecked=0, Total=71022 [2018-12-03 15:51:02,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:51:02,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 15:51:02,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 15:51:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 15:51:02,840 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 161 [2018-12-03 15:51:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:02,841 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 15:51:02,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-12-03 15:51:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 15:51:02,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:51:02,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:02,842 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 1, 1, 1, 1] [2018-12-03 15:51:02,842 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:02,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:02,842 INFO L82 PathProgramCache]: Analyzing trace with hash -503108840, now seen corresponding path program 104 times [2018-12-03 15:51:02,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:02,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:02,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:02,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:02,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:04,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:04,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:04,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:04,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:04,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:04,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:04,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:04,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:04,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 15:51:04,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:04,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:04,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:07,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 1431 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:07,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:07,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 58 [2018-12-03 15:51:07,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:07,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:51:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:51:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:51:07,031 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 59 states. [2018-12-03 15:51:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:08,470 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2018-12-03 15:51:08,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 15:51:08,470 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 162 [2018-12-03 15:51:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:08,471 INFO L225 Difference]: With dead ends: 171 [2018-12-03 15:51:08,471 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 15:51:08,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 268 SyntacticMatches, 106 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5885 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4734, Invalid=7922, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:51:08,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 15:51:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-12-03 15:51:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 15:51:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 15:51:08,534 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 15:51:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:08,534 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 15:51:08,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:51:08,534 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 15:51:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 15:51:08,534 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:08,535 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1, 1] [2018-12-03 15:51:08,535 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:08,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1843761522, now seen corresponding path program 105 times [2018-12-03 15:51:08,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:08,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:08,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:12,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:12,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:12,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:12,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:12,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:12,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:12,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:12,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:12,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:12,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:12,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:20,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:24,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4293 backedges. 2862 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:24,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:24,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 15:51:24,338 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:24,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-12-03 15:51:24,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-12-03 15:51:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9127, Invalid=38179, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:51:24,340 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 218 states. [2018-12-03 15:51:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:32,952 INFO L93 Difference]: Finished difference Result 277 states and 279 transitions. [2018-12-03 15:51:32,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 15:51:32,952 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 164 [2018-12-03 15:51:32,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:32,952 INFO L225 Difference]: With dead ends: 277 [2018-12-03 15:51:32,953 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:51:32,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 112 SyntacticMatches, 107 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40070 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=13744, Invalid=59968, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 15:51:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:51:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 15:51:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 15:51:33,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-12-03 15:51:33,022 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 164 [2018-12-03 15:51:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:33,022 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-12-03 15:51:33,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-12-03 15:51:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-12-03 15:51:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 15:51:33,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:33,023 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1] [2018-12-03 15:51:33,023 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:33,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:33,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1318614313, now seen corresponding path program 106 times [2018-12-03 15:51:33,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:33,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:33,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:34,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:34,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:34,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:34,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:34,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:34,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:34,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:34,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:34,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:34,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:37,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 1485 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:37,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:37,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 59 [2018-12-03 15:51:37,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:37,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:51:37,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:51:37,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1658, Invalid=1882, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:51:37,065 INFO L87 Difference]: Start difference. First operand 166 states and 167 transitions. Second operand 60 states. [2018-12-03 15:51:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:38,616 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-12-03 15:51:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 15:51:38,616 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 165 [2018-12-03 15:51:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:38,617 INFO L225 Difference]: With dead ends: 174 [2018-12-03 15:51:38,617 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 15:51:38,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 273 SyntacticMatches, 108 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6104 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4904, Invalid=8206, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:51:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 15:51:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2018-12-03 15:51:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 15:51:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-12-03 15:51:38,679 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 165 [2018-12-03 15:51:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:38,680 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-12-03 15:51:38,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:51:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-12-03 15:51:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 15:51:38,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:38,680 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1, 1] [2018-12-03 15:51:38,680 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:38,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 173054787, now seen corresponding path program 107 times [2018-12-03 15:51:38,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:38,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:38,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:38,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:38,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:42,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:42,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:42,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:42,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:42,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:42,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:42,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:42,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:43,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 15:51:43,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:43,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:51,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 2970 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:55,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:55,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 15:51:55,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:55,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-12-03 15:51:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-12-03 15:51:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9461, Invalid=39601, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 15:51:55,145 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 222 states. [2018-12-03 15:52:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:02,456 INFO L93 Difference]: Finished difference Result 282 states and 284 transitions. [2018-12-03 15:52:02,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 15:52:02,456 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 167 [2018-12-03 15:52:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:02,457 INFO L225 Difference]: With dead ends: 282 [2018-12-03 15:52:02,457 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 15:52:02,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 114 SyntacticMatches, 109 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41582 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=14246, Invalid=62206, Unknown=0, NotChecked=0, Total=76452 [2018-12-03 15:52:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 15:52:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 15:52:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 15:52:02,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 15:52:02,522 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 167 [2018-12-03 15:52:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:02,523 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 15:52:02,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-12-03 15:52:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 15:52:02,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 15:52:02,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:02,524 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 1, 1, 1, 1] [2018-12-03 15:52:02,524 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:02,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:02,524 INFO L82 PathProgramCache]: Analyzing trace with hash 2078410796, now seen corresponding path program 108 times [2018-12-03 15:52:02,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:02,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:02,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:02,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:02,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:03,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:03,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:03,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:03,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:03,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:03,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:03,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:03,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:04,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:04,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:04,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:04,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 1540 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:06,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:06,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 60 [2018-12-03 15:52:06,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:06,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:52:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:52:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:52:06,415 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 61 states. [2018-12-03 15:52:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:08,294 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-12-03 15:52:08,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 15:52:08,294 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 168 [2018-12-03 15:52:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:08,294 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:52:08,295 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:52:08,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 278 SyntacticMatches, 110 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6327 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5077, Invalid=8495, Unknown=0, NotChecked=0, Total=13572 [2018-12-03 15:52:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:52:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2018-12-03 15:52:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 15:52:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 15:52:08,366 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 15:52:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:08,366 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 15:52:08,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:52:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 15:52:08,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:52:08,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:08,367 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1, 1] [2018-12-03 15:52:08,367 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:08,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:08,367 INFO L82 PathProgramCache]: Analyzing trace with hash 193034630, now seen corresponding path program 109 times [2018-12-03 15:52:08,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:08,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:08,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:08,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:12,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:12,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:12,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:12,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:12,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:12,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:12,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:12,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:12,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:21,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:25,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4620 backedges. 3080 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:25,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:25,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-03 15:52:25,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:25,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-12-03 15:52:25,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-12-03 15:52:25,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9801, Invalid=41049, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 15:52:25,341 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 226 states. [2018-12-03 15:52:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:33,032 INFO L93 Difference]: Finished difference Result 287 states and 289 transitions. [2018-12-03 15:52:33,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 15:52:33,032 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 170 [2018-12-03 15:52:33,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:33,033 INFO L225 Difference]: With dead ends: 287 [2018-12-03 15:52:33,033 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 15:52:33,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 116 SyntacticMatches, 111 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43122 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=14757, Invalid=64485, Unknown=0, NotChecked=0, Total=79242 [2018-12-03 15:52:33,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 15:52:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 15:52:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 15:52:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2018-12-03 15:52:33,096 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 170 [2018-12-03 15:52:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:33,096 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2018-12-03 15:52:33,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-12-03 15:52:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2018-12-03 15:52:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 15:52:33,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:33,097 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 1, 1, 1, 1] [2018-12-03 15:52:33,097 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:33,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash 366114813, now seen corresponding path program 110 times [2018-12-03 15:52:33,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:33,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:33,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:34,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:34,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:34,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:34,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:34,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:34,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:34,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:34,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:52:34,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:34,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:34,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 1596 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:37,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:37,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 61 [2018-12-03 15:52:37,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:37,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:52:37,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:52:37,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1775, Invalid=2007, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:52:37,236 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand 62 states. [2018-12-03 15:52:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:39,085 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2018-12-03 15:52:39,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 15:52:39,086 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 171 [2018-12-03 15:52:39,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:39,086 INFO L225 Difference]: With dead ends: 180 [2018-12-03 15:52:39,086 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:52:39,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 512 GetRequests, 283 SyntacticMatches, 112 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6554 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5253, Invalid=8789, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:52:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:52:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2018-12-03 15:52:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 15:52:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-12-03 15:52:39,149 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 171 [2018-12-03 15:52:39,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:39,149 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-12-03 15:52:39,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:52:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-12-03 15:52:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 15:52:39,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:39,150 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1, 1] [2018-12-03 15:52:39,150 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:39,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash -350930665, now seen corresponding path program 111 times [2018-12-03 15:52:39,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:39,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:39,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:39,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:39,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:43,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:43,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:43,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:43,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:43,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:43,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:43,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:43,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:43,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:43,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:43,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:43,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:52,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:56,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4788 backedges. 3192 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:56,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 229 [2018-12-03 15:52:56,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:56,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-12-03 15:52:56,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-12-03 15:52:56,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10147, Invalid=42523, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 15:52:56,582 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 230 states. [2018-12-03 15:53:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:06,078 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2018-12-03 15:53:06,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 15:53:06,078 INFO L78 Accepts]: Start accepts. Automaton has 230 states. Word has length 173 [2018-12-03 15:53:06,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:06,079 INFO L225 Difference]: With dead ends: 292 [2018-12-03 15:53:06,079 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:53:06,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 118 SyntacticMatches, 113 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44690 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=15277, Invalid=66805, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 15:53:06,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:53:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 15:53:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:53:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-03 15:53:06,147 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 173 [2018-12-03 15:53:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:06,147 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-03 15:53:06,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 230 states. [2018-12-03 15:53:06,148 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-03 15:53:06,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 15:53:06,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:06,148 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 1, 1, 1, 1] [2018-12-03 15:53:06,148 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:06,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:06,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1920045888, now seen corresponding path program 112 times [2018-12-03 15:53:06,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:06,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:06,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:06,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:07,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:07,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:07,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:07,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:07,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 1653 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:10,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 62 [2018-12-03 15:53:10,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:10,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:53:10,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:53:10,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 15:53:10,712 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 63 states. [2018-12-03 15:53:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:12,377 INFO L93 Difference]: Finished difference Result 183 states and 184 transitions. [2018-12-03 15:53:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-03 15:53:12,377 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 174 [2018-12-03 15:53:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:12,378 INFO L225 Difference]: With dead ends: 183 [2018-12-03 15:53:12,378 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:53:12,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 288 SyntacticMatches, 114 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6785 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5432, Invalid=9088, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 15:53:12,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:53:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-12-03 15:53:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:53:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 15:53:12,447 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-03 15:53:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:12,447 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 15:53:12,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:53:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 15:53:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 15:53:12,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:12,448 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1, 1] [2018-12-03 15:53:12,448 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:12,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1671786598, now seen corresponding path program 113 times [2018-12-03 15:53:12,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:12,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:12,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:12,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:17,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:17,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:17,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:17,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:17,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:17,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:17,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:17,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:17,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 15:53:17,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:17,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4959 backedges. 3306 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:30,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:30,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117] total 233 [2018-12-03 15:53:30,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:30,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 234 states [2018-12-03 15:53:30,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2018-12-03 15:53:30,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10499, Invalid=44023, Unknown=0, NotChecked=0, Total=54522 [2018-12-03 15:53:30,925 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 234 states. [2018-12-03 15:53:35,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:35,867 INFO L93 Difference]: Finished difference Result 297 states and 299 transitions. [2018-12-03 15:53:35,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-12-03 15:53:35,867 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 176 [2018-12-03 15:53:35,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:35,868 INFO L225 Difference]: With dead ends: 297 [2018-12-03 15:53:35,868 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:53:35,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 120 SyntacticMatches, 115 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46286 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=15806, Invalid=69166, Unknown=0, NotChecked=0, Total=84972 [2018-12-03 15:53:35,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:53:35,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 15:53:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 15:53:35,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-12-03 15:53:35,938 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 176 [2018-12-03 15:53:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:35,939 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-12-03 15:53:35,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 234 states. [2018-12-03 15:53:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2018-12-03 15:53:35,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 15:53:35,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:35,939 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 1, 1, 1, 1] [2018-12-03 15:53:35,939 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:35,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:35,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1334142767, now seen corresponding path program 114 times [2018-12-03 15:53:35,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:35,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:35,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:35,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:37,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:37,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:37,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:37,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:37,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:37,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:37,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:37,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:37,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:37,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:37,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:40,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 1711 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:40,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:40,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 63 [2018-12-03 15:53:40,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:40,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:53:40,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:53:40,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1896, Invalid=2136, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:53:40,390 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand 64 states. [2018-12-03 15:53:42,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:42,079 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-12-03 15:53:42,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 15:53:42,079 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 177 [2018-12-03 15:53:42,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:42,080 INFO L225 Difference]: With dead ends: 186 [2018-12-03 15:53:42,080 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 15:53:42,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 293 SyntacticMatches, 116 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7020 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5614, Invalid=9392, Unknown=0, NotChecked=0, Total=15006 [2018-12-03 15:53:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 15:53:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-12-03 15:53:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 15:53:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-12-03 15:53:42,151 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 177 [2018-12-03 15:53:42,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:42,151 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-12-03 15:53:42,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:53:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-12-03 15:53:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 15:53:42,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:42,152 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1, 1] [2018-12-03 15:53:42,152 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:42,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2084074731, now seen corresponding path program 115 times [2018-12-03 15:53:42,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:42,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:42,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:42,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:42,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:46,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:46,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:46,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:46,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:46,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:46,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:46,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:46,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:01,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5133 backedges. 3422 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:01,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:01,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 237 [2018-12-03 15:54:01,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:01,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 238 states [2018-12-03 15:54:01,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 238 interpolants. [2018-12-03 15:54:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10857, Invalid=45549, Unknown=0, NotChecked=0, Total=56406 [2018-12-03 15:54:01,086 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 238 states. [2018-12-03 15:54:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:07,729 INFO L93 Difference]: Finished difference Result 302 states and 304 transitions. [2018-12-03 15:54:07,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-12-03 15:54:07,729 INFO L78 Accepts]: Start accepts. Automaton has 238 states. Word has length 179 [2018-12-03 15:54:07,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:07,729 INFO L225 Difference]: With dead ends: 302 [2018-12-03 15:54:07,729 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:54:07,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 122 SyntacticMatches, 117 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47910 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=16344, Invalid=71568, Unknown=0, NotChecked=0, Total=87912 [2018-12-03 15:54:07,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:54:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 15:54:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 15:54:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 15:54:07,806 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 179 [2018-12-03 15:54:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:07,807 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 15:54:07,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 238 states. [2018-12-03 15:54:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 15:54:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 15:54:07,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:07,808 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 1, 1, 1, 1] [2018-12-03 15:54:07,808 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:07,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash 2018036820, now seen corresponding path program 116 times [2018-12-03 15:54:07,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:07,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:07,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:07,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:07,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:09,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:09,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:09,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:09,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:09,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:09,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:09,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:09,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:09,695 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-12-03 15:54:09,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:09,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:09,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 1770 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:12,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:12,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 64 [2018-12-03 15:54:12,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:12,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:54:12,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:54:12,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:54:12,635 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 65 states. [2018-12-03 15:54:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:14,389 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-12-03 15:54:14,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 15:54:14,393 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 180 [2018-12-03 15:54:14,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:14,393 INFO L225 Difference]: With dead ends: 189 [2018-12-03 15:54:14,393 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:54:14,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 298 SyntacticMatches, 118 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7259 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5799, Invalid=9701, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:54:14,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:54:14,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-12-03 15:54:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 15:54:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-03 15:54:14,461 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-03 15:54:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:14,461 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-03 15:54:14,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:54:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-03 15:54:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 15:54:14,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:14,461 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1, 1] [2018-12-03 15:54:14,462 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:14,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:14,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1991781458, now seen corresponding path program 117 times [2018-12-03 15:54:14,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:14,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:14,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:14,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:14,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5310 backedges. 3540 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:19,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:19,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:19,324 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:19,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:19,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:19,324 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:19,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:19,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:19,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:19,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:19,489 INFO L273 TraceCheckSpWp]: Computing forward predicates...