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_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:57:02,671 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:57:02,673 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:57:02,686 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:57:02,686 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:57:02,687 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:57:02,688 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:57:02,690 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:57:02,692 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:57:02,693 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:57:02,694 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:57:02,694 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:57:02,695 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:57:02,696 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:57:02,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:57:02,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:57:02,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:57:02,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:57:02,704 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:57:02,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:57:02,707 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:57:02,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:57:02,711 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:57:02,711 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:57:02,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:57:02,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:57:02,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:57:02,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:57:02,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:57:02,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:57:02,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:57:02,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:57:02,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:57:02,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:57:02,721 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:57:02,722 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:57:02,723 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-04 11:57:02,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:57:02,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:57:02,749 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:57:02,749 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:57:02,749 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:57:02,750 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:57:02,750 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:57:02,750 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:57:02,750 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:57:02,750 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-04 11:57:02,751 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-04 11:57:02,751 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:57:02,751 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:57:02,751 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:57:02,752 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:57:02,752 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:57:02,752 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:57:02,753 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:57:02,753 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:57:02,753 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:57:02,753 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:57:02,753 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:57:02,755 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:57:02,755 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:57:02,755 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:57:02,755 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:57:02,756 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:57:02,756 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:57:02,756 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:57:02,756 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:57:02,756 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:57:02,757 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:57:02,757 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:57:02,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:57:02,758 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:57:02,758 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:57:02,758 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:57:02,758 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:57:02,759 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:57:02,759 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:57:02,803 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:57:02,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:57:02,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:57:02,821 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:57:02,822 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:57:02,823 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-12-04 11:57:02,823 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-12-04 11:57:02,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:57:02,861 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:57:02,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:02,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:57:02,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:57:02,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:57:02,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:57:02,903 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:57:02,903 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:57:02,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,921 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/1) ... [2018-12-04 11:57:02,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:57:02,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:57:02,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:57:02,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:57:02,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (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-04 11:57:03,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:57:03,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:57:03,309 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:57:03,309 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-04 11:57:03,310 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:03 BoogieIcfgContainer [2018-12-04 11:57:03,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:57:03,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:57:03,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:57:03,317 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:57:03,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:57:02" (1/2) ... [2018-12-04 11:57:03,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3756663a and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:57:03, skipping insertion in model container [2018-12-04 11:57:03,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:57:03" (2/2) ... [2018-12-04 11:57:03,320 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-12-04 11:57:03,332 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:57:03,342 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:57:03,363 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:57:03,405 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:57:03,405 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:57:03,405 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:57:03,405 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:57:03,406 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:57:03,406 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:57:03,406 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:57:03,406 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:57:03,424 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-04 11:57:03,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:57:03,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:57:03,442 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,455 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-04 11:57:03,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:03,599 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-04 11:57:03,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:57:03,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-04 11:57:03,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:57:03,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:57:03,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:57:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:57:03,623 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-04 11:57:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:03,733 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-04 11:57:03,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:57:03,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:57:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:03,771 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:57:03,771 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:57:03,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:57:03,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:57:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:57:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:57:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-04 11:57:03,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-04 11:57:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:03,851 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-04 11:57:03,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:57:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-04 11:57:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:57:03,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:03,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-04 11:57:03,852 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:03,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:03,853 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-04 11:57:03,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:03,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:03,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:03,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:57:04,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:04,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:04,016 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-04 11:57:04,018 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-04 11:57:04,082 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 11:57:04,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:57:18,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:57:18,409 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-04 11:57:18,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:18,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:57:18,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:18,454 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-04 11:57:18,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:18,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:18,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:57:18,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 11:57:18,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:18,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-04 11:57:18,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:18,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:57:18,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:57:18,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:57:18,648 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-04 11:57:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:18,678 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-04 11:57:18,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:57:18,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-04 11:57:18,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:18,679 INFO L225 Difference]: With dead ends: 13 [2018-12-04 11:57:18,679 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:57:18,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-04 11:57:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:57:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-04 11:57:18,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:57:18,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-04 11:57:18,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-04 11:57:18,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:18,684 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-04 11:57:18,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:57:18,684 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-04 11:57:18,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:57:18,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:18,685 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-04 11:57:18,685 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:18,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:18,686 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2018-12-04 11:57:18,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:18,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:18,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:18,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:18,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:57:18,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:18,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:18,784 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:18,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:18,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:18,784 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-04 11:57:18,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:18,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:18,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:57:18,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:18,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:18,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:57:18,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:57:18,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:18,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-04 11:57:18,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:18,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:57:18,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:57:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:57:18,875 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-04 11:57:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:18,911 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-04 11:57:18,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 11:57:18,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-04 11:57:18,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:18,912 INFO L225 Difference]: With dead ends: 16 [2018-12-04 11:57:18,912 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:57:18,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-04 11:57:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:57:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:57:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:57:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-04 11:57:18,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-04 11:57:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:18,916 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-04 11:57:18,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:57:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-04 11:57:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:57:18,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:18,917 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-04 11:57:18,917 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:18,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2018-12-04 11:57:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:18,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:18,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:18,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:57:18,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:18,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:18,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:18,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:18,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,000 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-04 11:57:19,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:19,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:19,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:19,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:19,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:57:19,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-04 11:57:19,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:19,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-04 11:57:19,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:19,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-04 11:57:19,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-04 11:57:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:57:19,129 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-04 11:57:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:19,175 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-04 11:57:19,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 11:57:19,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-04 11:57:19,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:19,176 INFO L225 Difference]: With dead ends: 19 [2018-12-04 11:57:19,176 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:57:19,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:57:19,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:57:19,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-04 11:57:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-04 11:57:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-04 11:57:19,180 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-04 11:57:19,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:19,180 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-04 11:57:19,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-04 11:57:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-04 11:57:19,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-04 11:57:19,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:19,181 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-04 11:57:19,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:19,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2018-12-04 11:57:19,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:19,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:19,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:57:19,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:19,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:19,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:19,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,257 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-04 11:57:19,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:19,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:19,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:57:19,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:57:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:19,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-04 11:57:19,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:19,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:57:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:57:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:57:19,471 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-04 11:57:19,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:19,518 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-04 11:57:19,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:57:19,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-04 11:57:19,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:19,519 INFO L225 Difference]: With dead ends: 22 [2018-12-04 11:57:19,520 INFO L226 Difference]: Without dead ends: 15 [2018-12-04 11:57:19,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-04 11:57:19,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-04 11:57:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-04 11:57:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-04 11:57:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-04 11:57:19,523 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-04 11:57:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:19,524 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-04 11:57:19,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:57:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-04 11:57:19,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-04 11:57:19,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:19,525 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-04 11:57:19,525 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:19,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:19,525 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2018-12-04 11:57:19,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:19,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:19,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:57:19,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:19,628 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:19,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:19,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:57:19,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:19,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:19,651 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:57:19,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:19,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:19,658 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:57:19,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-04 11:57:19,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:19,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-04 11:57:19,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:19,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 11:57:19,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 11:57:19,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:57:19,743 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-04 11:57:19,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:19,795 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-04 11:57:19,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 11:57:19,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-04 11:57:19,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:19,797 INFO L225 Difference]: With dead ends: 25 [2018-12-04 11:57:19,797 INFO L226 Difference]: Without dead ends: 17 [2018-12-04 11:57:19,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:57:19,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-04 11:57:19,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-04 11:57:19,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 11:57:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-04 11:57:19,802 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-04 11:57:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:19,802 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-04 11:57:19,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 11:57:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-04 11:57:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 11:57:19,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:19,803 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-04 11:57:19,803 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:19,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2018-12-04 11:57:19,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:19,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:19,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:57:19,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:19,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:19,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:19,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:19,886 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-04 11:57:19,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:19,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:19,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:19,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:19,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:57:19,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:57:20,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:20,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-04 11:57:20,088 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:20,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-04 11:57:20,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-04 11:57:20,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:57:20,089 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-04 11:57:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:20,128 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-04 11:57:20,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:57:20,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-04 11:57:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:20,129 INFO L225 Difference]: With dead ends: 28 [2018-12-04 11:57:20,130 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:57:20,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:57:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:57:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-04 11:57:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:57:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-04 11:57:20,135 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-04 11:57:20,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:20,135 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-04 11:57:20,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-04 11:57:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-04 11:57:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-04 11:57:20,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:20,136 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-04 11:57:20,136 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:20,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2018-12-04 11:57:20,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:20,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:20,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:20,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:20,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:57:20,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:20,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:20,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:20,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:20,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:20,285 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-04 11:57:20,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:20,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:20,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:57:20,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-04 11:57:20,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:20,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-04 11:57:20,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:20,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:57:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:57:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:57:20,578 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-04 11:57:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:20,626 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-04 11:57:20,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 11:57:20,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-04 11:57:20,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:20,631 INFO L225 Difference]: With dead ends: 31 [2018-12-04 11:57:20,631 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:57:20,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-04 11:57:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:57:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-04 11:57:20,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:57:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-04 11:57:20,635 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-04 11:57:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:20,635 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-04 11:57:20,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:57:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-04 11:57:20,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:57:20,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:20,636 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-04 11:57:20,636 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:20,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:20,637 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2018-12-04 11:57:20,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:20,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:20,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:20,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:20,745 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:57:20,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:20,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:20,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:20,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:20,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:20,746 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-04 11:57:20,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:20,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:20,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-04 11:57:20,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:20,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:57:20,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:57:20,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:20,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-04 11:57:20,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:20,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:57:20,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:57:20,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:57:20,987 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-04 11:57:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:21,115 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-04 11:57:21,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:57:21,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-04 11:57:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:21,116 INFO L225 Difference]: With dead ends: 34 [2018-12-04 11:57:21,116 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:57:21,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-04 11:57:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:57:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-04 11:57:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-04 11:57:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-04 11:57:21,122 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-04 11:57:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:21,122 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-04 11:57:21,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:57:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-04 11:57:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-04 11:57:21,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:21,123 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-04 11:57:21,123 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:21,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:21,124 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2018-12-04 11:57:21,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:21,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:21,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:21,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:21,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:57:21,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:21,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:21,305 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:21,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:21,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:21,305 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-04 11:57:21,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:21,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:21,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:21,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:21,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:57:21,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-04 11:57:21,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:21,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-04 11:57:21,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:21,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-04 11:57:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-04 11:57:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:57:21,733 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-04 11:57:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:21,794 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-04 11:57:21,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 11:57:21,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-04 11:57:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:21,795 INFO L225 Difference]: With dead ends: 37 [2018-12-04 11:57:21,795 INFO L226 Difference]: Without dead ends: 25 [2018-12-04 11:57:21,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:57:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-04 11:57:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-04 11:57:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-04 11:57:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-04 11:57:21,800 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-04 11:57:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:21,800 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-04 11:57:21,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-04 11:57:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-04 11:57:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-04 11:57:21,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:21,801 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-04 11:57:21,802 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:21,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2018-12-04 11:57:21,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:21,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:21,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:21,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:21,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:57:22,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:22,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:22,020 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:22,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:22,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:22,020 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-04 11:57:22,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:22,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:22,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:22,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:57:22,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:22,371 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:57:22,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:22,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-04 11:57:22,392 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:22,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-04 11:57:22,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-04 11:57:22,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:57:22,393 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-04 11:57:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:22,442 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-04 11:57:22,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-04 11:57:22,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-04 11:57:22,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:22,445 INFO L225 Difference]: With dead ends: 40 [2018-12-04 11:57:22,445 INFO L226 Difference]: Without dead ends: 27 [2018-12-04 11:57:22,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-04 11:57:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-04 11:57:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-04 11:57:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-04 11:57:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-04 11:57:22,449 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-04 11:57:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:22,450 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-04 11:57:22,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-04 11:57:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-04 11:57:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-04 11:57:22,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:22,451 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-04 11:57:22,451 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:22,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:22,451 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2018-12-04 11:57:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:22,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:22,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:22,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:57:22,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:22,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:22,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:22,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:22,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:22,612 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-04 11:57:22,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:22,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:22,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-04 11:57:22,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:22,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:57:22,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-04 11:57:22,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:22,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-04 11:57:22,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:22,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 11:57:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 11:57:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:57:22,888 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-04 11:57:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:23,027 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-04 11:57:23,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-04 11:57:23,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-04 11:57:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:23,029 INFO L225 Difference]: With dead ends: 43 [2018-12-04 11:57:23,029 INFO L226 Difference]: Without dead ends: 29 [2018-12-04 11:57:23,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-04 11:57:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-04 11:57:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-04 11:57:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-04 11:57:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-04 11:57:23,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-04 11:57:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:23,036 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-04 11:57:23,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 11:57:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-04 11:57:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-04 11:57:23,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:23,037 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-04 11:57:23,038 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:23,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:23,038 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2018-12-04 11:57:23,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:23,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:23,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:23,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:23,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:57:23,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:23,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:23,229 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:23,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:23,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:23,230 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-04 11:57:23,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:23,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:23,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:23,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:23,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:57:23,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:57:23,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:23,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-04 11:57:23,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:23,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-04 11:57:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-04 11:57:23,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:57:23,530 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-04 11:57:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:23,629 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-04 11:57:23,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:57:23,629 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-04 11:57:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:23,630 INFO L225 Difference]: With dead ends: 46 [2018-12-04 11:57:23,630 INFO L226 Difference]: Without dead ends: 31 [2018-12-04 11:57:23,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:57:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-04 11:57:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-04 11:57:23,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 11:57:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-04 11:57:23,636 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-04 11:57:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:23,637 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-04 11:57:23,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-04 11:57:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-04 11:57:23,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 11:57:23,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:23,638 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-04 11:57:23,638 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:23,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2018-12-04 11:57:23,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:23,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:23,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:23,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:23,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:57:23,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:23,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:23,812 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:23,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:23,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:23,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 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-04 11:57:23,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:23,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:23,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:57:23,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-04 11:57:24,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:24,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-04 11:57:24,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:24,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-04 11:57:24,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-04 11:57:24,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:57:24,147 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-04 11:57:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:24,279 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-04 11:57:24,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 11:57:24,281 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-04 11:57:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:24,281 INFO L225 Difference]: With dead ends: 49 [2018-12-04 11:57:24,282 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:57:24,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:57:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:57:24,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-04 11:57:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-04 11:57:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-04 11:57:24,287 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-04 11:57:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:24,287 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-04 11:57:24,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-04 11:57:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-04 11:57:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-04 11:57:24,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:24,289 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-04 11:57:24,289 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:24,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2018-12-04 11:57:24,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:24,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:24,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:24,497 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:57:24,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:24,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:24,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:24,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:24,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:24,498 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-04 11:57:24,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:24,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:24,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 11:57:24,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:24,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:57:24,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:57:25,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:25,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-04 11:57:25,016 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:25,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:57:25,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:57:25,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:57:25,018 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-04 11:57:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:25,093 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-04 11:57:25,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-04 11:57:25,095 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-04 11:57:25,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:25,095 INFO L225 Difference]: With dead ends: 52 [2018-12-04 11:57:25,096 INFO L226 Difference]: Without dead ends: 35 [2018-12-04 11:57:25,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-04 11:57:25,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-04 11:57:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-04 11:57:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 11:57:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-04 11:57:25,100 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-04 11:57:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:25,100 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-04 11:57:25,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:57:25,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-04 11:57:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 11:57:25,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:25,101 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-04 11:57:25,101 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:25,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2018-12-04 11:57:25,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:25,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:25,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:25,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:25,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:57:25,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:25,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:25,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:25,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:25,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:25,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 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-04 11:57:25,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:25,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:25,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:25,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:25,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:57:25,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-04 11:57:25,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:25,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-04 11:57:25,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:25,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-04 11:57:25,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-04 11:57:25,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:57:25,805 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-04 11:57:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:25,866 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-04 11:57:25,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 11:57:25,867 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-04 11:57:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:25,868 INFO L225 Difference]: With dead ends: 55 [2018-12-04 11:57:25,868 INFO L226 Difference]: Without dead ends: 37 [2018-12-04 11:57:25,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:57:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-04 11:57:25,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-04 11:57:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-04 11:57:25,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-04 11:57:25,874 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-04 11:57:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:25,876 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-04 11:57:25,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-04 11:57:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-04 11:57:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-04 11:57:25,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:25,876 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-04 11:57:25,877 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:25,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:25,877 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2018-12-04 11:57:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:25,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:25,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:25,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:57:26,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:26,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:26,362 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:26,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:26,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:26,362 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-04 11:57:26,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:26,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:26,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:57:26,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:57:27,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:27,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-04 11:57:27,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:27,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-04 11:57:27,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-04 11:57:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:57:27,270 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-04 11:57:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:27,363 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-04 11:57:27,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:57:27,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-04 11:57:27,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:27,364 INFO L225 Difference]: With dead ends: 58 [2018-12-04 11:57:27,364 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:57:27,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-04 11:57:27,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:57:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-04 11:57:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-04 11:57:27,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-04 11:57:27,370 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-04 11:57:27,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:27,370 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-04 11:57:27,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-04 11:57:27,370 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-04 11:57:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-04 11:57:27,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:27,371 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-04 11:57:27,371 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:27,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2018-12-04 11:57:27,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:27,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:27,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:27,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:27,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:57:28,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:28,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:28,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:28,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:28,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:28,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:57:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:28,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:28,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-04 11:57:28,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:28,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:28,435 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:57:28,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-04 11:57:29,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:29,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-04 11:57:29,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:29,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-04 11:57:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-04 11:57:29,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:57:29,072 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-04 11:57:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:29,148 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-04 11:57:29,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:57:29,148 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-04 11:57:29,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:29,149 INFO L225 Difference]: With dead ends: 61 [2018-12-04 11:57:29,149 INFO L226 Difference]: Without dead ends: 41 [2018-12-04 11:57:29,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:57:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-04 11:57:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-04 11:57:29,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-04 11:57:29,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-04 11:57:29,158 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-04 11:57:29,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:29,158 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-04 11:57:29,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-04 11:57:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-04 11:57:29,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-04 11:57:29,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:29,159 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-04 11:57:29,160 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:29,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:29,160 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2018-12-04 11:57:29,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:29,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:29,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:29,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:29,675 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:57:29,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:29,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:29,675 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:29,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:29,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:29,676 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-04 11:57:29,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:29,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:29,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:29,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:29,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:57:29,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:30,290 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:57:30,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:30,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-04 11:57:30,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:30,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-04 11:57:30,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-04 11:57:30,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:57:30,311 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-04 11:57:30,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:30,492 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-04 11:57:30,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-04 11:57:30,492 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-04 11:57:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:30,493 INFO L225 Difference]: With dead ends: 64 [2018-12-04 11:57:30,493 INFO L226 Difference]: Without dead ends: 43 [2018-12-04 11:57:30,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:57:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-04 11:57:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-04 11:57:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-04 11:57:30,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-04 11:57:30,497 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-04 11:57:30,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:30,497 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-04 11:57:30,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-04 11:57:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-04 11:57:30,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-04 11:57:30,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:30,498 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-04 11:57:30,499 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:30,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:30,499 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2018-12-04 11:57:30,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:30,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:57:31,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:31,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:31,461 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:31,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:31,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:31,461 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-04 11:57:31,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:31,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:31,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:57:31,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:32,069 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-04 11:57:32,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:32,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-04 11:57:32,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:32,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-04 11:57:32,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-04 11:57:32,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:57:32,091 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-04 11:57:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:32,184 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-04 11:57:32,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 11:57:32,185 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-04 11:57:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:32,185 INFO L225 Difference]: With dead ends: 67 [2018-12-04 11:57:32,185 INFO L226 Difference]: Without dead ends: 45 [2018-12-04 11:57:32,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 11:57:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-04 11:57:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-04 11:57:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 11:57:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-04 11:57:32,191 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-04 11:57:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:32,191 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-04 11:57:32,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-04 11:57:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-04 11:57:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 11:57:32,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:32,192 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-04 11:57:32,192 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:32,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:32,192 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2018-12-04 11:57:32,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:32,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:32,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:32,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:32,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:57:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:32,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:32,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:32,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:32,645 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-04 11:57:32,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:32,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:32,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 11:57:32,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:32,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:57:32,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:57:33,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:33,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-04 11:57:33,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:33,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:57:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:57:33,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:57:33,455 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-04 11:57:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:33,539 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-04 11:57:33,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-04 11:57:33,539 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-04 11:57:33,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:33,540 INFO L225 Difference]: With dead ends: 70 [2018-12-04 11:57:33,541 INFO L226 Difference]: Without dead ends: 47 [2018-12-04 11:57:33,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 11:57:33,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-04 11:57:33,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-04 11:57:33,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-04 11:57:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-04 11:57:33,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-04 11:57:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:33,550 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-04 11:57:33,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:57:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-04 11:57:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-04 11:57:33,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:33,551 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-04 11:57:33,552 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:33,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:33,552 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2018-12-04 11:57:33,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:33,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:33,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:33,554 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:57:33,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:33,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:33,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:33,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:33,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:33,976 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-04 11:57:33,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:33,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:34,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:34,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:34,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:57:34,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-04 11:57:34,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:34,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-04 11:57:34,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:34,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-04 11:57:34,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-04 11:57:34,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:57:34,955 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-04 11:57:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:35,055 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-04 11:57:35,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-04 11:57:35,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-04 11:57:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:35,059 INFO L225 Difference]: With dead ends: 73 [2018-12-04 11:57:35,059 INFO L226 Difference]: Without dead ends: 49 [2018-12-04 11:57:35,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:57:35,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-04 11:57:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-04 11:57:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 11:57:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-04 11:57:35,064 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-04 11:57:35,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:35,064 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-04 11:57:35,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-04 11:57:35,064 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-04 11:57:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 11:57:35,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:35,065 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-04 11:57:35,065 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:35,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2018-12-04 11:57:35,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:35,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:35,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:57:35,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:35,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:35,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:35,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:35,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:35,595 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-04 11:57:35,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:35,606 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:35,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:57:35,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:57:36,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:36,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-04 11:57:36,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:36,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-04 11:57:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-04 11:57:36,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:57:36,252 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-04 11:57:36,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:36,383 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-04 11:57:36,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-04 11:57:36,386 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-04 11:57:36,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:36,387 INFO L225 Difference]: With dead ends: 76 [2018-12-04 11:57:36,387 INFO L226 Difference]: Without dead ends: 51 [2018-12-04 11:57:36,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-04 11:57:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-04 11:57:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-04 11:57:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-04 11:57:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-04 11:57:36,393 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-04 11:57:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:36,393 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-04 11:57:36,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-04 11:57:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-04 11:57:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-04 11:57:36,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:36,394 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-04 11:57:36,394 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:36,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2018-12-04 11:57:36,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:36,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:36,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:36,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:36,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:57:36,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:36,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:36,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:36,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:36,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:36,923 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-04 11:57:36,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:36,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:37,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 11:57:37,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:37,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:57:37,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:38,022 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-04 11:57:38,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:38,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-04 11:57:38,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:38,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 11:57:38,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 11:57:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:57:38,044 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-04 11:57:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:38,156 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-04 11:57:38,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:57:38,157 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-04 11:57:38,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:38,157 INFO L225 Difference]: With dead ends: 79 [2018-12-04 11:57:38,157 INFO L226 Difference]: Without dead ends: 53 [2018-12-04 11:57:38,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 11:57:38,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-04 11:57:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-04 11:57:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-04 11:57:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-04 11:57:38,161 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-04 11:57:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:38,161 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-04 11:57:38,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 11:57:38,161 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-04 11:57:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-04 11:57:38,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:38,162 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-04 11:57:38,162 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:38,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:38,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2018-12-04 11:57:38,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:38,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:38,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:38,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:38,699 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:57:38,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:38,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:38,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:38,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:38,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:38,700 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-04 11:57:38,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:38,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:38,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:38,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:38,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:38,761 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:57:38,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:57:39,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:39,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-04 11:57:39,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:39,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:57:39,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:57:39,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:57:39,500 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-04 11:57:39,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:39,607 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-04 11:57:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:57:39,608 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-04 11:57:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:39,609 INFO L225 Difference]: With dead ends: 82 [2018-12-04 11:57:39,609 INFO L226 Difference]: Without dead ends: 55 [2018-12-04 11:57:39,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:57:39,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-04 11:57:39,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-04 11:57:39,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-04 11:57:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-04 11:57:39,615 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-04 11:57:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:39,615 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-04 11:57:39,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:57:39,615 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-04 11:57:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-04 11:57:39,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:39,616 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-04 11:57:39,616 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:39,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:39,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2018-12-04 11:57:39,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:39,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:39,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:39,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:39,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:57:40,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:40,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:40,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:40,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:40,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:40,023 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-04 11:57:40,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:40,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:40,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:57:40,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-04 11:57:40,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:40,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-04 11:57:40,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:40,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-04 11:57:40,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-04 11:57:40,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:57:40,867 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-04 11:57:40,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:40,956 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-04 11:57:40,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-04 11:57:40,957 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-04 11:57:40,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:40,958 INFO L225 Difference]: With dead ends: 85 [2018-12-04 11:57:40,958 INFO L226 Difference]: Without dead ends: 57 [2018-12-04 11:57:40,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:57:40,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-04 11:57:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-04 11:57:40,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-04 11:57:40,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-04 11:57:40,964 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-04 11:57:40,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:40,964 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-04 11:57:40,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-04 11:57:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-04 11:57:40,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-04 11:57:40,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:40,965 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-04 11:57:40,965 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:40,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2018-12-04 11:57:40,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:40,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:40,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:40,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:40,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:57:41,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:41,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:41,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:41,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:41,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:41,604 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-04 11:57:41,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:41,613 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:41,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-04 11:57:41,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:41,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:57:41,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:57:43,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:43,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-04 11:57:43,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:43,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:57:43,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:57:43,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:57:43,559 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-04 11:57:43,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:43,653 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-04 11:57:43,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-04 11:57:43,654 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-04 11:57:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:43,655 INFO L225 Difference]: With dead ends: 88 [2018-12-04 11:57:43,655 INFO L226 Difference]: Without dead ends: 59 [2018-12-04 11:57:43,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-04 11:57:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-04 11:57:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-04 11:57:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 11:57:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-04 11:57:43,659 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-04 11:57:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:43,659 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-04 11:57:43,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:57:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-04 11:57:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 11:57:43,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:43,660 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-04 11:57:43,660 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:43,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:43,660 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2018-12-04 11:57:43,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:43,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:43,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:57:44,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:44,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:44,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:44,062 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:44,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:44,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:57:44,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:44,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:44,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:44,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:44,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:57:44,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:44,983 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-04 11:57:45,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:45,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-04 11:57:45,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:45,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-04 11:57:45,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-04 11:57:45,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:57:45,004 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-04 11:57:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:45,124 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-12-04 11:57:45,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 11:57:45,125 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-04 11:57:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:45,125 INFO L225 Difference]: With dead ends: 91 [2018-12-04 11:57:45,126 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:57:45,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:57:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:57:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-04 11:57:45,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-04 11:57:45,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-04 11:57:45,130 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-04 11:57:45,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:45,130 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-04 11:57:45,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-04 11:57:45,130 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-04 11:57:45,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-04 11:57:45,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:45,131 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-04 11:57:45,131 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:45,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:45,132 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2018-12-04 11:57:45,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:45,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:45,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:45,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:45,578 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:57:45,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:45,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:45,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:45,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:45,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:45,579 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-04 11:57:45,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:45,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:45,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:57:45,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:57:46,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:46,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-04 11:57:46,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:46,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-04 11:57:46,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-04 11:57:46,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:57:46,850 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-04 11:57:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:46,981 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-04 11:57:46,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:57:46,982 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-04 11:57:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:46,983 INFO L225 Difference]: With dead ends: 94 [2018-12-04 11:57:46,983 INFO L226 Difference]: Without dead ends: 63 [2018-12-04 11:57:46,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 11:57:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-04 11:57:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-04 11:57:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 11:57:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-04 11:57:46,986 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-04 11:57:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:46,987 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-04 11:57:46,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-04 11:57:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-04 11:57:46,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 11:57:46,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:46,988 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-04 11:57:46,988 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:46,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2018-12-04 11:57:46,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:46,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:46,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:46,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:47,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:57:47,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:47,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:47,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:47,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:47,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:47,407 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-04 11:57:47,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:47,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:47,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 11:57:47,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:47,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:57:47,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:48,830 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-04 11:57:48,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:48,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-04 11:57:48,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:48,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 11:57:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 11:57:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:57:48,851 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-04 11:57:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:48,967 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-04 11:57:48,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:57:48,967 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-04 11:57:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:48,968 INFO L225 Difference]: With dead ends: 97 [2018-12-04 11:57:48,968 INFO L226 Difference]: Without dead ends: 65 [2018-12-04 11:57:48,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:57:48,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-04 11:57:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-04 11:57:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-04 11:57:48,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-04 11:57:48,972 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-12-04 11:57:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:48,973 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-04 11:57:48,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 11:57:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-04 11:57:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-04 11:57:48,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:48,974 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-04 11:57:48,974 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:48,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2018-12-04 11:57:48,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:48,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:48,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:57:49,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:49,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:49,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:49,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:49,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:49,791 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-04 11:57:49,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:49,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:49,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:49,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:49,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:57:49,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:57:51,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:51,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-04 11:57:51,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:51,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-04 11:57:51,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-04 11:57:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:57:51,570 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-04 11:57:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:51,734 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-04 11:57:51,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-04 11:57:51,735 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-04 11:57:51,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:51,736 INFO L225 Difference]: With dead ends: 100 [2018-12-04 11:57:51,736 INFO L226 Difference]: Without dead ends: 67 [2018-12-04 11:57:51,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:57:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-04 11:57:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-04 11:57:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-04 11:57:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-04 11:57:51,740 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-04 11:57:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:51,740 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-04 11:57:51,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-04 11:57:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-04 11:57:51,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-04 11:57:51,741 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:51,741 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-04 11:57:51,741 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:51,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:51,742 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2018-12-04 11:57:51,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:51,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:51,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:51,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:57:52,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:52,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:52,300 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:52,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:52,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:52,301 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-04 11:57:52,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:52,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:52,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:57:52,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-04 11:57:53,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:53,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-04 11:57:53,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:53,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-04 11:57:53,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-04 11:57:53,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:57:53,794 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-04 11:57:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:53,917 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-12-04 11:57:53,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 11:57:53,917 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-04 11:57:53,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:53,918 INFO L225 Difference]: With dead ends: 103 [2018-12-04 11:57:53,918 INFO L226 Difference]: Without dead ends: 69 [2018-12-04 11:57:53,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 11:57:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-04 11:57:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-04 11:57:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-04 11:57:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-04 11:57:53,922 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-04 11:57:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:53,922 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-04 11:57:53,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-04 11:57:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-04 11:57:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-04 11:57:53,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:53,923 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-04 11:57:53,923 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:53,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2018-12-04 11:57:53,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:53,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:53,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:57:55,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:55,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:55,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:55,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:55,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:55,072 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-04 11:57:55,080 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:57:55,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:57:55,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-04 11:57:55,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:55,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:57:55,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:57:56,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:56,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-04 11:57:56,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:56,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:57:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:57:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:57:56,459 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-04 11:57:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:56,613 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-04 11:57:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:57:56,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-04 11:57:56,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:56,614 INFO L225 Difference]: With dead ends: 106 [2018-12-04 11:57:56,614 INFO L226 Difference]: Without dead ends: 71 [2018-12-04 11:57:56,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-04 11:57:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-04 11:57:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-04 11:57:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-04 11:57:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-04 11:57:56,619 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-04 11:57:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:56,620 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-04 11:57:56,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:57:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-04 11:57:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-04 11:57:56,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:56,620 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-04 11:57:56,621 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:56,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2018-12-04 11:57:56,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:56,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:56,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:57:57,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:57,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:57,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:57,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:57,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:57,145 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-04 11:57:57,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:57:57,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:57:57,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:57:57,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:57:57,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:57,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:57:57,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:57:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-04 11:57:58,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:57:58,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-04 11:57:58,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:57:58,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-04 11:57:58,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-04 11:57:58,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:57:58,846 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-04 11:57:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:57:59,027 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-12-04 11:57:59,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 11:57:59,028 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-04 11:57:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:57:59,029 INFO L225 Difference]: With dead ends: 109 [2018-12-04 11:57:59,029 INFO L226 Difference]: Without dead ends: 73 [2018-12-04 11:57:59,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:57:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-04 11:57:59,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-04 11:57:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 11:57:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-04 11:57:59,033 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-12-04 11:57:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:57:59,033 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-04 11:57:59,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-04 11:57:59,034 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-04 11:57:59,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 11:57:59,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:57:59,034 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-04 11:57:59,034 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:57:59,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:57:59,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2018-12-04 11:57:59,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:57:59,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:59,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:57:59,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:57:59,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:57:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:57:59,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:59,615 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:57:59,615 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:57:59,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:57:59,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:57:59,615 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-04 11:57:59,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:57:59,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:57:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:57:59,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:57:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:57:59,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:58:01,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:01,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-04 11:58:01,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:01,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-04 11:58:01,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-04 11:58:01,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:58:01,197 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-04 11:58:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:01,368 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-04 11:58:01,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:58:01,369 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-04 11:58:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:01,370 INFO L225 Difference]: With dead ends: 112 [2018-12-04 11:58:01,370 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 11:58:01,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-04 11:58:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 11:58:01,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-04 11:58:01,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-04 11:58:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-04 11:58:01,374 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-04 11:58:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:01,374 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-04 11:58:01,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-04 11:58:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-04 11:58:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-04 11:58:01,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:01,376 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-04 11:58:01,376 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:01,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2018-12-04 11:58:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:01,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:01,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:01,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:58:01,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:01,937 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:01,937 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:01,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:01,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:01,937 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-04 11:58:01,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:01,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:02,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-04 11:58:02,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:02,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:58:02,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-04 11:58:03,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:03,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-04 11:58:03,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:03,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 11:58:03,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 11:58:03,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:58:03,982 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-04 11:58:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:04,111 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-04 11:58:04,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-04 11:58:04,112 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-04 11:58:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:04,113 INFO L225 Difference]: With dead ends: 115 [2018-12-04 11:58:04,113 INFO L226 Difference]: Without dead ends: 77 [2018-12-04 11:58:04,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 11:58:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-04 11:58:04,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-04 11:58:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-04 11:58:04,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-04 11:58:04,116 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-04 11:58:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:04,116 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-04 11:58:04,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 11:58:04,116 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-04 11:58:04,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-04 11:58:04,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:04,116 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-04 11:58:04,116 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:04,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:04,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2018-12-04 11:58:04,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:04,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:04,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:58:04,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:04,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:04,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:04,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:04,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:04,942 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-04 11:58:04,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:04,951 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:05,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:05,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:05,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:58:05,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:58:06,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:06,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-04 11:58:06,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:06,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-04 11:58:06,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-04 11:58:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:58:06,629 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-04 11:58:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:06,782 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-12-04 11:58:06,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:58:06,783 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-04 11:58:06,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:06,784 INFO L225 Difference]: With dead ends: 118 [2018-12-04 11:58:06,784 INFO L226 Difference]: Without dead ends: 79 [2018-12-04 11:58:06,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:58:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-04 11:58:06,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-04 11:58:06,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-04 11:58:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-04 11:58:06,786 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-04 11:58:06,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:06,787 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-04 11:58:06,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-04 11:58:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-04 11:58:06,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-04 11:58:06,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:06,787 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-04 11:58:06,788 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:06,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:06,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2018-12-04 11:58:06,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:06,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:06,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:06,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:58:07,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:07,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:07,548 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:07,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:07,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:07,549 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-04 11:58:07,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:07,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:07,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:58:07,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-04 11:58:09,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:09,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-04 11:58:09,539 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:09,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-04 11:58:09,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-04 11:58:09,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:58:09,541 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-04 11:58:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:09,705 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-12-04 11:58:09,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 11:58:09,706 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-04 11:58:09,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:09,707 INFO L225 Difference]: With dead ends: 121 [2018-12-04 11:58:09,707 INFO L226 Difference]: Without dead ends: 81 [2018-12-04 11:58:09,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:58:09,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-04 11:58:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-04 11:58:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-04 11:58:09,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-04 11:58:09,712 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-04 11:58:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:09,712 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-04 11:58:09,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-04 11:58:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-04 11:58:09,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-04 11:58:09,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:09,713 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-04 11:58:09,713 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:09,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:09,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2018-12-04 11:58:09,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:09,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:09,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:09,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:11,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:58:11,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:11,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:11,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:11,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:11,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:11,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:58:11,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:11,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:11,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 11:58:11,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:11,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:58:11,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:58:13,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:13,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-04 11:58:13,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:13,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:58:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:58:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:58:13,990 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-04 11:58:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:14,146 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-12-04 11:58:14,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-04 11:58:14,146 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-04 11:58:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:14,147 INFO L225 Difference]: With dead ends: 124 [2018-12-04 11:58:14,147 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 11:58:14,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 11:58:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 11:58:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-04 11:58:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-04 11:58:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-04 11:58:14,151 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-04 11:58:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:14,151 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-04 11:58:14,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:58:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-04 11:58:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-04 11:58:14,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:14,152 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-04 11:58:14,152 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:14,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:14,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2018-12-04 11:58:14,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:14,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:14,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:14,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:14,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:58:15,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:15,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:15,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:15,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:15,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:15,087 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-04 11:58:15,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:15,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:15,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:15,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:15,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:58:15,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:16,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-04 11:58:16,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:16,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-04 11:58:16,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:16,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-04 11:58:16,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-04 11:58:16,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:58:16,908 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-04 11:58:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:17,072 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-12-04 11:58:17,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-04 11:58:17,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-04 11:58:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:17,073 INFO L225 Difference]: With dead ends: 127 [2018-12-04 11:58:17,073 INFO L226 Difference]: Without dead ends: 85 [2018-12-04 11:58:17,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:58:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-04 11:58:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-04 11:58:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-04 11:58:17,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-04 11:58:17,076 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-04 11:58:17,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:17,076 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-04 11:58:17,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-04 11:58:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-04 11:58:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-04 11:58:17,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:17,077 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-04 11:58:17,077 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:17,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2018-12-04 11:58:17,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:17,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:17,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:17,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:17,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:58:17,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:17,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:17,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:17,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:17,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:17,793 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-04 11:58:17,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:17,803 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:17,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:58:17,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:58:20,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:20,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-04 11:58:20,108 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:20,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-04 11:58:20,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-04 11:58:20,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:58:20,109 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-04 11:58:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:20,286 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-04 11:58:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-04 11:58:20,286 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-04 11:58:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:20,287 INFO L225 Difference]: With dead ends: 130 [2018-12-04 11:58:20,287 INFO L226 Difference]: Without dead ends: 87 [2018-12-04 11:58:20,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-04 11:58:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-04 11:58:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-04 11:58:20,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 11:58:20,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-04 11:58:20,291 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-04 11:58:20,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:20,291 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-04 11:58:20,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-04 11:58:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-04 11:58:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 11:58:20,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:20,292 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-04 11:58:20,292 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:20,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2018-12-04 11:58:20,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:20,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:20,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:20,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:58:21,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:21,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:21,244 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:21,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:21,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:21,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 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-04 11:58:21,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:21,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:21,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 11:58:21,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:21,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:58:21,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-04 11:58:23,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:23,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-04 11:58:23,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:23,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 11:58:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 11:58:23,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:58:23,852 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-04 11:58:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:24,020 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-04 11:58:24,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 11:58:24,020 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-04 11:58:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:24,021 INFO L225 Difference]: With dead ends: 133 [2018-12-04 11:58:24,021 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 11:58:24,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:58:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 11:58:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-04 11:58:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-04 11:58:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-04 11:58:24,024 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-12-04 11:58:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:24,025 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-04 11:58:24,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 11:58:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-04 11:58:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-04 11:58:24,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:24,025 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-04 11:58:24,026 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:24,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2018-12-04 11:58:24,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:24,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:24,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:24,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:24,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:58:24,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:24,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:24,831 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:24,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:24,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:24,832 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-04 11:58:24,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:24,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:24,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:24,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:24,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:58:24,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:58:27,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:27,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-04 11:58:27,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:27,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-04 11:58:27,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-04 11:58:27,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:58:27,076 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-04 11:58:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:27,258 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-12-04 11:58:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-04 11:58:27,259 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-04 11:58:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:27,260 INFO L225 Difference]: With dead ends: 136 [2018-12-04 11:58:27,260 INFO L226 Difference]: Without dead ends: 91 [2018-12-04 11:58:27,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:58:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-04 11:58:27,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-04 11:58:27,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-04 11:58:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-04 11:58:27,264 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-04 11:58:27,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:27,264 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-04 11:58:27,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-04 11:58:27,264 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-04 11:58:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-04 11:58:27,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:27,265 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-04 11:58:27,265 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:27,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2018-12-04 11:58:27,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:27,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:27,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:58:28,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:28,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:28,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:28,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:28,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:28,844 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-04 11:58:28,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:28,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:28,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:28,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:58:28,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-04 11:58:31,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:31,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-04 11:58:31,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:31,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-04 11:58:31,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-04 11:58:31,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:58:31,135 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-04 11:58:31,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:31,401 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-12-04 11:58:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-04 11:58:31,401 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-04 11:58:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:31,402 INFO L225 Difference]: With dead ends: 139 [2018-12-04 11:58:31,402 INFO L226 Difference]: Without dead ends: 93 [2018-12-04 11:58:31,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-04 11:58:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-04 11:58:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-04 11:58:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-04 11:58:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-04 11:58:31,406 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-04 11:58:31,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:31,406 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-04 11:58:31,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-04 11:58:31,406 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-04 11:58:31,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-04 11:58:31,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:31,407 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-04 11:58:31,407 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:31,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:31,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2018-12-04 11:58:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:31,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:31,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:31,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:58:33,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:33,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:33,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:33,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:33,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:33,093 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-04 11:58:33,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:33,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:33,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-04 11:58:33,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:33,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:58:33,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:58:35,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:35,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-04 11:58:35,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:35,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:58:35,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:58:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:58:35,964 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-04 11:58:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:37,548 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-12-04 11:58:37,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 11:58:37,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-04 11:58:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:37,549 INFO L225 Difference]: With dead ends: 142 [2018-12-04 11:58:37,550 INFO L226 Difference]: Without dead ends: 95 [2018-12-04 11:58:37,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 11:58:37,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-04 11:58:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-04 11:58:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-04 11:58:37,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-04 11:58:37,553 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-04 11:58:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:37,553 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-04 11:58:37,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:58:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-04 11:58:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-04 11:58:37,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:37,553 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-04 11:58:37,554 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:37,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:37,554 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2018-12-04 11:58:37,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:37,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:37,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:37,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:37,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:37,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:38,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:58:38,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:38,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:38,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:38,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:38,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:38,564 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-04 11:58:38,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:38,574 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:38,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:38,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:38,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:38,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:58:38,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-04 11:58:42,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:42,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-04 11:58:42,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:42,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-04 11:58:42,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-04 11:58:42,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:58:42,797 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-04 11:58:43,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:43,087 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-04 11:58:43,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 11:58:43,094 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-04 11:58:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:43,095 INFO L225 Difference]: With dead ends: 145 [2018-12-04 11:58:43,095 INFO L226 Difference]: Without dead ends: 97 [2018-12-04 11:58:43,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:58:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-04 11:58:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-04 11:58:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-04 11:58:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-04 11:58:43,099 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-12-04 11:58:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:43,099 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-04 11:58:43,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-04 11:58:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-04 11:58:43,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-04 11:58:43,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:43,100 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-04 11:58:43,100 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:43,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2018-12-04 11:58:43,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:43,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:43,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:43,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:43,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:44,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:58:44,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:44,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:44,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:44,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:44,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:44,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 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-04 11:58:44,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:44,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:44,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:58:44,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:58:46,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:46,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-04 11:58:46,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:46,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-04 11:58:46,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-04 11:58:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:58:46,987 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-04 11:58:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:47,160 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-12-04 11:58:47,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-04 11:58:47,160 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-04 11:58:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:47,161 INFO L225 Difference]: With dead ends: 148 [2018-12-04 11:58:47,161 INFO L226 Difference]: Without dead ends: 99 [2018-12-04 11:58:47,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-04 11:58:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-04 11:58:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-04 11:58:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-04 11:58:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-04 11:58:47,164 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-04 11:58:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:47,165 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-04 11:58:47,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-04 11:58:47,165 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-04 11:58:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-04 11:58:47,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:47,166 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-04 11:58:47,166 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:47,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:47,166 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2018-12-04 11:58:47,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:47,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:47,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:47,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:48,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:58:48,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:48,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:48,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:48,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:48,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:48,328 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-04 11:58:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:58:48,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:58:48,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 11:58:48,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:48,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:58:48,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-04 11:58:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-04 11:58:51,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:51,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 11:58:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 11:58:51,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:58:51,830 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-04 11:58:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:52,021 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-12-04 11:58:52,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 11:58:52,021 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-04 11:58:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:52,022 INFO L225 Difference]: With dead ends: 151 [2018-12-04 11:58:52,022 INFO L226 Difference]: Without dead ends: 101 [2018-12-04 11:58:52,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 11:58:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-04 11:58:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-04 11:58:52,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 11:58:52,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-04 11:58:52,027 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-04 11:58:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:52,027 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-04 11:58:52,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 11:58:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-04 11:58:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 11:58:52,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:52,028 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-04 11:58:52,028 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:52,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:52,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2018-12-04 11:58:52,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:52,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:52,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:52,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:52,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:58:53,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:53,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:53,225 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:53,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:53,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:53,226 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-04 11:58:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:58:53,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:58:53,306 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:58:53,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:58:53,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:58:53,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:58:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:58:56,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:58:56,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-04 11:58:56,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:58:56,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-04 11:58:56,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-04 11:58:56,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:58:56,108 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-04 11:58:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:58:56,381 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-12-04 11:58:56,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-04 11:58:56,381 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-04 11:58:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:58:56,382 INFO L225 Difference]: With dead ends: 154 [2018-12-04 11:58:56,382 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 11:58:56,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:58:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 11:58:56,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-04 11:58:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-04 11:58:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-04 11:58:56,386 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-04 11:58:56,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:58:56,386 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-04 11:58:56,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-04 11:58:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-04 11:58:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-04 11:58:56,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:58:56,387 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-04 11:58:56,387 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:58:56,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:58:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2018-12-04 11:58:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:58:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:56,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:58:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:58:56,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:58:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:58:57,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:57,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:58:57,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:58:57,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:58:57,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:58:57,641 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-04 11:58:57,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:58:57,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:58:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:58:57,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:58:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:58:57,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-04 11:59:00,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:00,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-04 11:59:00,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:00,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-04 11:59:00,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-04 11:59:00,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:59:00,717 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-04 11:59:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:00,962 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-12-04 11:59:00,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 11:59:00,962 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-04 11:59:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:00,963 INFO L225 Difference]: With dead ends: 157 [2018-12-04 11:59:00,963 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 11:59:00,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:59:00,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 11:59:00,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-04 11:59:00,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 11:59:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-04 11:59:00,967 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-04 11:59:00,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:00,967 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-04 11:59:00,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-04 11:59:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-04 11:59:00,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 11:59:00,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:00,968 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-04 11:59:00,968 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:00,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2018-12-04 11:59:00,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:00,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:00,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:59:02,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:02,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:02,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:02,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:02,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:02,005 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-04 11:59:02,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:02,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:03,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-04 11:59:03,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:03,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:59:03,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:59:06,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:06,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-04 11:59:06,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:06,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:59:06,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:59:06,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:59:06,339 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-04 11:59:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:07,288 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-04 11:59:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-04 11:59:07,288 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-04 11:59:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:07,289 INFO L225 Difference]: With dead ends: 160 [2018-12-04 11:59:07,290 INFO L226 Difference]: Without dead ends: 107 [2018-12-04 11:59:07,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 11:59:07,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-04 11:59:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-04 11:59:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-04 11:59:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-04 11:59:07,294 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-04 11:59:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:07,294 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-04 11:59:07,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:59:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-04 11:59:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-04 11:59:07,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:07,295 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-04 11:59:07,295 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:07,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2018-12-04 11:59:07,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:07,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:07,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:07,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:59:08,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:08,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:08,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:08,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:08,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:08,339 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-04 11:59:08,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:08,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:08,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:08,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:08,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:59:08,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-04 11:59:11,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:11,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-04 11:59:11,696 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:11,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-04 11:59:11,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-04 11:59:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:59:11,698 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-04 11:59:11,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:11,936 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-12-04 11:59:11,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 11:59:11,936 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-04 11:59:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:11,937 INFO L225 Difference]: With dead ends: 163 [2018-12-04 11:59:11,937 INFO L226 Difference]: Without dead ends: 109 [2018-12-04 11:59:11,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:59:11,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-04 11:59:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-04 11:59:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-04 11:59:11,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-04 11:59:11,940 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-04 11:59:11,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:11,940 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-04 11:59:11,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-04 11:59:11,941 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-04 11:59:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-04 11:59:11,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:11,941 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-04 11:59:11,941 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:11,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2018-12-04 11:59:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:11,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:11,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:11,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:11,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:13,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:59:13,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:13,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:13,104 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:13,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:13,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:13,104 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-04 11:59:13,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:13,114 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:13,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:13,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:59:13,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:16,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:59:16,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:16,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-04 11:59:16,432 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:16,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:59:16,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:59:16,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:59:16,434 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-04 11:59:16,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:16,684 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-12-04 11:59:16,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 11:59:16,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-04 11:59:16,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:16,685 INFO L225 Difference]: With dead ends: 166 [2018-12-04 11:59:16,685 INFO L226 Difference]: Without dead ends: 111 [2018-12-04 11:59:16,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-04 11:59:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-04 11:59:16,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-04 11:59:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-04 11:59:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-04 11:59:16,689 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-04 11:59:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:16,689 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-04 11:59:16,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:59:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-04 11:59:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-04 11:59:16,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:16,690 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-04 11:59:16,690 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:16,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:16,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2018-12-04 11:59:16,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:16,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:16,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:16,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:16,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-04 11:59:17,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:17,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:17,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:17,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:17,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:17,920 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-04 11:59:17,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:17,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:19,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-04 11:59:19,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:19,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-04 11:59:19,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-04 11:59:22,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-04 11:59:22,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:22,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-04 11:59:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-04 11:59:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:59:22,766 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-12-04 11:59:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:23,036 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-12-04 11:59:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-04 11:59:23,036 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-04 11:59:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:23,037 INFO L225 Difference]: With dead ends: 169 [2018-12-04 11:59:23,037 INFO L226 Difference]: Without dead ends: 113 [2018-12-04 11:59:23,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:59:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-04 11:59:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-04 11:59:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-04 11:59:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-04 11:59:23,041 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-12-04 11:59:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:23,041 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-04 11:59:23,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-04 11:59:23,041 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-04 11:59:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-04 11:59:23,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:23,042 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2018-12-04 11:59:23,042 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:23,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2018-12-04 11:59:23,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:23,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:23,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:23,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:23,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:23,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-04 11:59:24,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:24,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:24,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:24,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:24,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:24,750 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-04 11:59:24,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:24,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:24,838 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:24,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:24,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:24,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-04 11:59:24,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-04 11:59:28,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:28,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-04 11:59:28,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:28,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-04 11:59:28,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-04 11:59:28,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:59:28,295 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-12-04 11:59:28,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:28,538 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-12-04 11:59:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-04 11:59:28,539 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-04 11:59:28,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:28,539 INFO L225 Difference]: With dead ends: 172 [2018-12-04 11:59:28,540 INFO L226 Difference]: Without dead ends: 115 [2018-12-04 11:59:28,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:59:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-04 11:59:28,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-04 11:59:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-04 11:59:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-04 11:59:28,545 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-12-04 11:59:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:28,545 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-04 11:59:28,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-04 11:59:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-04 11:59:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-04 11:59:28,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:28,546 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2018-12-04 11:59:28,546 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:28,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2018-12-04 11:59:28,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:28,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:28,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:28,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:28,548 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-04 11:59:29,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:29,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:29,756 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:29,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:29,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:29,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 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-04 11:59:29,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:29,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:29,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-04 11:59:29,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-04 11:59:33,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:33,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-04 11:59:33,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:33,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-04 11:59:33,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-04 11:59:33,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:59:33,400 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-12-04 11:59:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:33,889 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-12-04 11:59:33,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-04 11:59:33,890 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-04 11:59:33,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:33,891 INFO L225 Difference]: With dead ends: 175 [2018-12-04 11:59:33,894 INFO L226 Difference]: Without dead ends: 117 [2018-12-04 11:59:33,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 11:59:33,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-04 11:59:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-04 11:59:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-04 11:59:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-04 11:59:33,918 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-04 11:59:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:33,918 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-04 11:59:33,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-04 11:59:33,918 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-04 11:59:33,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-04 11:59:33,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:33,919 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2018-12-04 11:59:33,919 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:33,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2018-12-04 11:59:33,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:33,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:33,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:33,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:35,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-04 11:59:35,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:35,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:35,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:35,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:35,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:35,427 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-04 11:59:35,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:35,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:36,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-04 11:59:36,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:36,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-04 11:59:36,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-04 11:59:39,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:39,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-04 11:59:39,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:39,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 11:59:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 11:59:39,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-04 11:59:39,938 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-12-04 11:59:40,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:40,336 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-12-04 11:59:40,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-04 11:59:40,336 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-04 11:59:40,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:40,337 INFO L225 Difference]: With dead ends: 178 [2018-12-04 11:59:40,337 INFO L226 Difference]: Without dead ends: 119 [2018-12-04 11:59:40,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-04 11:59:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-04 11:59:40,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-04 11:59:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-04 11:59:40,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-12-04 11:59:40,342 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-12-04 11:59:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:40,342 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-12-04 11:59:40,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 11:59:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-12-04 11:59:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-04 11:59:40,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:40,343 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2018-12-04 11:59:40,343 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:40,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:40,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2018-12-04 11:59:40,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:40,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:40,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:40,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:40,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-04 11:59:41,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:41,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:41,694 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:41,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:41,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:41,695 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-04 11:59:41,702 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:59:41,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:59:41,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:59:41,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:41,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-04 11:59:41,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:45,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-04 11:59:45,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:45,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-04 11:59:45,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:45,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-04 11:59:45,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-04 11:59:45,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:59:45,774 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-12-04 11:59:46,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:46,075 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-12-04 11:59:46,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-04 11:59:46,075 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-04 11:59:46,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:46,076 INFO L225 Difference]: With dead ends: 181 [2018-12-04 11:59:46,076 INFO L226 Difference]: Without dead ends: 121 [2018-12-04 11:59:46,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:59:46,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-04 11:59:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-04 11:59:46,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-04 11:59:46,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-04 11:59:46,080 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-12-04 11:59:46,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:46,080 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-04 11:59:46,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-04 11:59:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-04 11:59:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-04 11:59:46,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:46,081 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2018-12-04 11:59:46,081 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:46,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2018-12-04 11:59:46,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:46,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:46,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:46,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-04 11:59:47,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:47,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:47,376 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:47,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:47,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:47,376 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-04 11:59:47,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:47,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:59:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:47,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-04 11:59:47,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-04 11:59:51,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:51,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-04 11:59:51,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:51,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-04 11:59:51,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-04 11:59:51,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 11:59:51,399 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-12-04 11:59:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:51,829 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-12-04 11:59:51,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-04 11:59:51,830 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-04 11:59:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:51,830 INFO L225 Difference]: With dead ends: 184 [2018-12-04 11:59:51,830 INFO L226 Difference]: Without dead ends: 123 [2018-12-04 11:59:51,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 11:59:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-04 11:59:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-04 11:59:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-04 11:59:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-04 11:59:51,834 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-04 11:59:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:51,835 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-04 11:59:51,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-04 11:59:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-04 11:59:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-04 11:59:51,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:51,836 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2018-12-04 11:59:51,836 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:51,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:51,836 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2018-12-04 11:59:51,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:51,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:51,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:59:51,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:51,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:59:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-04 11:59:53,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:53,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:59:53,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:59:53,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:59:53,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:59:53,370 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-04 11:59:53,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:59:53,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:59:54,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-04 11:59:54,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:59:54,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:59:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-04 11:59:54,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:59:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-04 11:59:58,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:59:58,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-04 11:59:58,614 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:59:58,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-04 11:59:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-04 11:59:58,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:59:58,616 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-12-04 11:59:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:59:58,966 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-12-04 11:59:58,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-04 11:59:58,967 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-04 11:59:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:59:58,967 INFO L225 Difference]: With dead ends: 187 [2018-12-04 11:59:58,968 INFO L226 Difference]: Without dead ends: 125 [2018-12-04 11:59:58,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 11:59:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-04 11:59:58,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-04 11:59:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-04 11:59:58,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-04 11:59:58,972 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-12-04 11:59:58,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:59:58,972 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-04 11:59:58,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-04 11:59:58,972 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-04 11:59:58,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-04 11:59:58,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:59:58,973 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2018-12-04 11:59:58,973 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:59:58,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:59:58,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2018-12-04 11:59:58,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:59:58,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:58,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:59:58,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:59:58,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:59:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-04 12:00:00,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:00,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:00,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:00,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:00,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:00,394 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-04 12:00:00,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:00,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:00,488 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:00,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:00,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-04 12:00:00,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-04 12:00:04,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:04,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-04 12:00:04,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:04,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-04 12:00:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-04 12:00:04,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 12:00:04,707 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-12-04 12:00:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:05,012 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-12-04 12:00:05,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-04 12:00:05,013 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-04 12:00:05,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:05,014 INFO L225 Difference]: With dead ends: 190 [2018-12-04 12:00:05,014 INFO L226 Difference]: Without dead ends: 127 [2018-12-04 12:00:05,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 12:00:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-04 12:00:05,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-04 12:00:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-04 12:00:05,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-04 12:00:05,019 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-12-04 12:00:05,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:05,019 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-04 12:00:05,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-04 12:00:05,019 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-04 12:00:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-04 12:00:05,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:05,020 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2018-12-04 12:00:05,020 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:05,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2018-12-04 12:00:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:05,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:05,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:06,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-04 12:00:06,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:06,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:06,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:06,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:06,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:06,653 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-04 12:00:06,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:06,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:06,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-04 12:00:06,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-04 12:00:10,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:10,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-04 12:00:10,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:10,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-04 12:00:10,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-04 12:00:10,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 12:00:10,823 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-12-04 12:00:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:11,270 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2018-12-04 12:00:11,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-04 12:00:11,271 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-04 12:00:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:11,271 INFO L225 Difference]: With dead ends: 193 [2018-12-04 12:00:11,272 INFO L226 Difference]: Without dead ends: 129 [2018-12-04 12:00:11,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 12:00:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-04 12:00:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-04 12:00:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-04 12:00:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-04 12:00:11,276 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-04 12:00:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:11,276 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-04 12:00:11,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-04 12:00:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-04 12:00:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-04 12:00:11,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:11,277 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2018-12-04 12:00:11,277 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:11,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2018-12-04 12:00:11,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:11,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:11,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:11,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:11,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-04 12:00:12,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:12,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:12,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:12,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:12,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:12,737 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-04 12:00:12,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:12,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:13,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-04 12:00:13,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:13,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-04 12:00:13,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-04 12:00:18,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:18,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-04 12:00:18,294 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:18,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 12:00:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 12:00:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-04 12:00:18,296 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-12-04 12:00:18,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:18,754 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-12-04 12:00:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-04 12:00:18,755 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-04 12:00:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:18,755 INFO L225 Difference]: With dead ends: 196 [2018-12-04 12:00:18,755 INFO L226 Difference]: Without dead ends: 131 [2018-12-04 12:00:18,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-04 12:00:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-04 12:00:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-04 12:00:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-04 12:00:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-04 12:00:18,760 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-12-04 12:00:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:18,760 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-04 12:00:18,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 12:00:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-04 12:00:18,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-04 12:00:18,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:18,761 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2018-12-04 12:00:18,761 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:18,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:18,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2018-12-04 12:00:18,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:18,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:18,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-04 12:00:20,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:20,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:20,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:20,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:20,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:20,289 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-04 12:00:20,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:20,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:20,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:20,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:20,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-04 12:00:20,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-04 12:00:25,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:25,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-04 12:00:25,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:25,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-04 12:00:25,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-04 12:00:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 12:00:25,052 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-12-04 12:00:25,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:25,494 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-12-04 12:00:25,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-04 12:00:25,494 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-04 12:00:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:25,495 INFO L225 Difference]: With dead ends: 199 [2018-12-04 12:00:25,495 INFO L226 Difference]: Without dead ends: 133 [2018-12-04 12:00:25,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 12:00:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-04 12:00:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-04 12:00:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-04 12:00:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-04 12:00:25,499 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-12-04 12:00:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:25,500 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-04 12:00:25,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-04 12:00:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-04 12:00:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-04 12:00:25,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:25,501 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2018-12-04 12:00:25,501 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:25,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:25,501 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2018-12-04 12:00:25,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:25,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:25,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:25,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:25,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:27,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-04 12:00:27,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:27,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:27,464 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:27,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:27,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:27,464 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-04 12:00:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:27,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:27,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-04 12:00:27,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:32,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-04 12:00:32,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:32,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-04 12:00:32,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:32,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-04 12:00:32,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-04 12:00:32,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-04 12:00:32,831 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-12-04 12:00:33,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:33,295 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-12-04 12:00:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-04 12:00:33,295 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-04 12:00:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:33,296 INFO L225 Difference]: With dead ends: 202 [2018-12-04 12:00:33,296 INFO L226 Difference]: Without dead ends: 135 [2018-12-04 12:00:33,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-04 12:00:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-04 12:00:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-04 12:00:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-04 12:00:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-04 12:00:33,300 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-04 12:00:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:33,300 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-04 12:00:33,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-04 12:00:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-04 12:00:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-04 12:00:33,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:33,301 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2018-12-04 12:00:33,301 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:33,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:33,302 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2018-12-04 12:00:33,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:33,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:33,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:33,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:33,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-04 12:00:35,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:35,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:35,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:35,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:35,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:35,541 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-04 12:00:35,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:35,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:38,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-04 12:00:38,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:39,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-04 12:00:39,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-04 12:00:43,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:43,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-04 12:00:43,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:43,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-04 12:00:43,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-04 12:00:43,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 12:00:43,872 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-12-04 12:00:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:44,296 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2018-12-04 12:00:44,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-04 12:00:44,296 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-04 12:00:44,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:44,297 INFO L225 Difference]: With dead ends: 205 [2018-12-04 12:00:44,297 INFO L226 Difference]: Without dead ends: 137 [2018-12-04 12:00:44,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 12:00:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-04 12:00:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-04 12:00:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-04 12:00:44,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-04 12:00:44,302 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-12-04 12:00:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:44,302 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-04 12:00:44,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-04 12:00:44,302 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-04 12:00:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-04 12:00:44,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:44,303 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2018-12-04 12:00:44,303 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:44,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2018-12-04 12:00:44,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:44,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:44,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:44,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:44,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-04 12:00:46,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:46,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:46,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:46,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:46,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:46,027 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-04 12:00:46,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:46,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:46,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:46,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:46,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-04 12:00:46,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-04 12:00:51,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:51,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-04 12:00:51,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:51,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-04 12:00:51,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-04 12:00:51,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 12:00:51,082 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-12-04 12:00:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:51,604 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2018-12-04 12:00:51,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-04 12:00:51,604 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-04 12:00:51,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:51,605 INFO L225 Difference]: With dead ends: 208 [2018-12-04 12:00:51,605 INFO L226 Difference]: Without dead ends: 139 [2018-12-04 12:00:51,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 12:00:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-04 12:00:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-04 12:00:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-04 12:00:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-04 12:00:51,609 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-12-04 12:00:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:51,609 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-04 12:00:51,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-04 12:00:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-04 12:00:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-04 12:00:51,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:51,610 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2018-12-04 12:00:51,611 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:51,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:51,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2018-12-04 12:00:51,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:51,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:51,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:51,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:51,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-04 12:00:53,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:53,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:53,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:53,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:53,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:53,619 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-04 12:00:53,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:53,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:53,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:53,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-04 12:00:53,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-04 12:00:58,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:58,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-04 12:00:58,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:58,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-04 12:00:58,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-04 12:00:58,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-04 12:00:58,855 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-12-04 12:00:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:59,357 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-12-04 12:00:59,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-04 12:00:59,358 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-04 12:00:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:59,358 INFO L225 Difference]: With dead ends: 211 [2018-12-04 12:00:59,359 INFO L226 Difference]: Without dead ends: 141 [2018-12-04 12:00:59,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-04 12:00:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-04 12:00:59,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-04 12:00:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-04 12:00:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-04 12:00:59,362 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-04 12:00:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:59,362 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-04 12:00:59,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-04 12:00:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-04 12:00:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-04 12:00:59,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:59,363 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2018-12-04 12:00:59,363 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:59,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2018-12-04 12:00:59,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:59,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:59,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-04 12:01:01,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:01,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:01,086 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:01,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:01,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:01,086 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-04 12:01:01,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:01,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:04,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-04 12:01:04,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:04,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-04 12:01:04,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-04 12:01:09,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:09,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-04 12:01:09,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:09,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 12:01:09,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 12:01:09,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 12:01:09,939 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-12-04 12:01:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:10,462 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2018-12-04 12:01:10,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-04 12:01:10,462 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-04 12:01:10,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:10,463 INFO L225 Difference]: With dead ends: 214 [2018-12-04 12:01:10,463 INFO L226 Difference]: Without dead ends: 143 [2018-12-04 12:01:10,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 12:01:10,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-04 12:01:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-04 12:01:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-04 12:01:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-12-04 12:01:10,467 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-12-04 12:01:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:10,467 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-12-04 12:01:10,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 12:01:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-12-04 12:01:10,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-04 12:01:10,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:10,468 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2018-12-04 12:01:10,468 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:10,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2018-12-04 12:01:10,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:10,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:10,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:10,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:10,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-04 12:01:12,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:12,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:12,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:12,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:12,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:12,294 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-04 12:01:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:12,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:12,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:12,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:12,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-04 12:01:12,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-04 12:01:17,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:17,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-04 12:01:17,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:17,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-04 12:01:17,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-04 12:01:17,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 12:01:17,925 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-12-04 12:01:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:18,454 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2018-12-04 12:01:18,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-04 12:01:18,454 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-04 12:01:18,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:18,455 INFO L225 Difference]: With dead ends: 217 [2018-12-04 12:01:18,455 INFO L226 Difference]: Without dead ends: 145 [2018-12-04 12:01:18,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 12:01:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-04 12:01:18,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-04 12:01:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-04 12:01:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-04 12:01:18,459 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-12-04 12:01:18,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:18,459 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-04 12:01:18,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-04 12:01:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-04 12:01:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-04 12:01:18,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:18,460 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2018-12-04 12:01:18,460 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:18,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:18,460 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2018-12-04 12:01:18,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:18,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:18,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:18,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:18,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-04 12:01:20,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:20,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:20,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:20,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:20,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:20,357 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-04 12:01:20,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:20,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:20,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-04 12:01:20,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-04 12:01:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:26,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-04 12:01:26,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:26,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-04 12:01:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-04 12:01:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-04 12:01:26,012 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-12-04 12:01:26,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:26,477 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-12-04 12:01:26,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-04 12:01:26,478 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-04 12:01:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:26,479 INFO L225 Difference]: With dead ends: 220 [2018-12-04 12:01:26,479 INFO L226 Difference]: Without dead ends: 147 [2018-12-04 12:01:26,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-04 12:01:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-04 12:01:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-04 12:01:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-04 12:01:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-04 12:01:26,484 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-04 12:01:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:26,484 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-04 12:01:26,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-04 12:01:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-04 12:01:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-04 12:01:26,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:26,485 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2018-12-04 12:01:26,486 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:26,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2018-12-04 12:01:26,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:26,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:26,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:26,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:26,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-04 12:01:28,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:28,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:28,751 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:28,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:28,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:28,752 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-04 12:01:28,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:28,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:31,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-04 12:01:31,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:31,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-04 12:01:31,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-04 12:01:37,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:37,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-04 12:01:37,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:37,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-04 12:01:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-04 12:01:37,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-04 12:01:37,476 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-12-04 12:01:38,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:38,139 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2018-12-04 12:01:38,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-04 12:01:38,140 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-04 12:01:38,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:38,140 INFO L225 Difference]: With dead ends: 223 [2018-12-04 12:01:38,140 INFO L226 Difference]: Without dead ends: 149 [2018-12-04 12:01:38,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-04 12:01:38,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-04 12:01:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-04 12:01:38,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-04 12:01:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-04 12:01:38,145 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-12-04 12:01:38,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:38,145 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-04 12:01:38,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-04 12:01:38,145 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-04 12:01:38,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-04 12:01:38,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:38,146 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2018-12-04 12:01:38,147 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:38,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:38,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2018-12-04 12:01:38,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:38,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:38,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:38,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-04 12:01:40,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:40,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:40,234 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:40,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:40,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:40,235 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-04 12:01:40,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:40,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:40,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:40,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:40,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:40,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-04 12:01:40,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:46,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-04 12:01:46,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:46,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-04 12:01:46,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:46,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-04 12:01:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-04 12:01:46,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 12:01:46,146 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-12-04 12:01:46,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:46,741 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-12-04 12:01:46,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-04 12:01:46,742 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-04 12:01:46,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:46,742 INFO L225 Difference]: With dead ends: 226 [2018-12-04 12:01:46,743 INFO L226 Difference]: Without dead ends: 151 [2018-12-04 12:01:46,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 12:01:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-04 12:01:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-04 12:01:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-04 12:01:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-04 12:01:46,747 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-12-04 12:01:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:46,748 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-04 12:01:46,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-04 12:01:46,748 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-04 12:01:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-04 12:01:46,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:46,749 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2018-12-04 12:01:46,749 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:46,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:46,749 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2018-12-04 12:01:46,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:46,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:46,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:46,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:46,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-04 12:01:49,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:49,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:49,224 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:49,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:49,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:49,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 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-04 12:01:49,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:49,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:49,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:49,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-04 12:01:49,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-04 12:01:55,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:55,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-04 12:01:55,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:55,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-04 12:01:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-04 12:01:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 12:01:55,375 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-12-04 12:01:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:55,942 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2018-12-04 12:01:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-04 12:01:55,942 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-04 12:01:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:55,943 INFO L225 Difference]: With dead ends: 229 [2018-12-04 12:01:55,943 INFO L226 Difference]: Without dead ends: 153 [2018-12-04 12:01:55,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 12:01:55,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-04 12:01:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-04 12:01:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-04 12:01:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-04 12:01:55,947 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-04 12:01:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:55,948 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-04 12:01:55,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-04 12:01:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-04 12:01:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-04 12:01:55,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:55,948 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2018-12-04 12:01:55,948 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:55,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:55,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2018-12-04 12:01:55,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:55,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:55,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:55,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:55,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-04 12:01:57,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:57,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:57,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:57,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:57,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:57,979 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-04 12:01:57,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:57,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:02:00,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-04 12:02:00,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:00,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-04 12:02:00,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-04 12:02:06,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:06,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-04 12:02:06,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:06,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 12:02:06,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 12:02:06,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-04 12:02:06,706 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-12-04 12:02:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:07,327 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2018-12-04 12:02:07,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-04 12:02:07,327 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-04 12:02:07,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:07,328 INFO L225 Difference]: With dead ends: 232 [2018-12-04 12:02:07,328 INFO L226 Difference]: Without dead ends: 155 [2018-12-04 12:02:07,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-04 12:02:07,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-04 12:02:07,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-04 12:02:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-04 12:02:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-04 12:02:07,331 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-12-04 12:02:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:07,332 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-04 12:02:07,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 12:02:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-04 12:02:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-04 12:02:07,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:07,332 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2018-12-04 12:02:07,333 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:07,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2018-12-04 12:02:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:07,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:07,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-04 12:02:09,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:09,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:09,678 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:09,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:09,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:09,678 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-04 12:02:09,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:02:09,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:02:09,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:02:09,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:09,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-04 12:02:09,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-04 12:02:16,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:16,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-04 12:02:16,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:16,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-04 12:02:16,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-04 12:02:16,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 12:02:16,232 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-12-04 12:02:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:16,954 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-12-04 12:02:16,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-04 12:02:16,955 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-04 12:02:16,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:16,955 INFO L225 Difference]: With dead ends: 235 [2018-12-04 12:02:16,955 INFO L226 Difference]: Without dead ends: 157 [2018-12-04 12:02:16,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 12:02:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-04 12:02:16,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-04 12:02:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-04 12:02:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-04 12:02:16,960 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-12-04 12:02:16,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:16,960 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-04 12:02:16,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-04 12:02:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-04 12:02:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-04 12:02:16,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:16,961 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2018-12-04 12:02:16,961 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:16,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:16,961 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2018-12-04 12:02:16,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:16,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:16,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-04 12:02:19,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:19,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:19,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:19,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:19,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:19,380 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-04 12:02:19,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:19,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:02:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:19,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-04 12:02:19,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-04 12:02:26,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:26,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-04 12:02:26,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:26,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-04 12:02:26,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-04 12:02:26,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-04 12:02:26,003 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-12-04 12:02:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:26,619 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-12-04 12:02:26,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-04 12:02:26,620 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-04 12:02:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:26,621 INFO L225 Difference]: With dead ends: 238 [2018-12-04 12:02:26,621 INFO L226 Difference]: Without dead ends: 159 [2018-12-04 12:02:26,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-04 12:02:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-04 12:02:26,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-04 12:02:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-04 12:02:26,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-04 12:02:26,625 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-04 12:02:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:26,625 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-04 12:02:26,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-04 12:02:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-04 12:02:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-04 12:02:26,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:26,626 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2018-12-04 12:02:26,626 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:26,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2018-12-04 12:02:26,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:26,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:26,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:28,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-04 12:02:28,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:28,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:28,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:28,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:28,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:28,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 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-04 12:02:28,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:02:28,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:02:33,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-04 12:02:33,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:33,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:33,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-04 12:02:33,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-04 12:02:40,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:40,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-04 12:02:40,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:40,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-04 12:02:40,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-04 12:02:40,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 12:02:40,516 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-12-04 12:02:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:41,273 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-12-04 12:02:41,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-04 12:02:41,273 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-04 12:02:41,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:41,274 INFO L225 Difference]: With dead ends: 241 [2018-12-04 12:02:41,274 INFO L226 Difference]: Without dead ends: 161 [2018-12-04 12:02:41,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 12:02:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-04 12:02:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-04 12:02:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-04 12:02:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-04 12:02:41,279 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-12-04 12:02:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:41,279 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-04 12:02:41,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-04 12:02:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-04 12:02:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-04 12:02:41,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:41,280 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2018-12-04 12:02:41,281 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:41,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2018-12-04 12:02:41,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:41,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:41,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:43,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-04 12:02:43,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:43,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:43,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:43,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:43,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:43,527 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-04 12:02:43,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:02:43,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:02:43,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:02:43,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:43,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-04 12:02:43,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-04 12:02:50,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:50,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-04 12:02:50,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:50,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-04 12:02:50,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-04 12:02:50,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 12:02:50,694 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-12-04 12:02:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:51,546 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2018-12-04 12:02:51,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-04 12:02:51,546 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-04 12:02:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:51,547 INFO L225 Difference]: With dead ends: 244 [2018-12-04 12:02:51,547 INFO L226 Difference]: Without dead ends: 163 [2018-12-04 12:02:51,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 12:02:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-04 12:02:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-04 12:02:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-04 12:02:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-04 12:02:51,552 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-12-04 12:02:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:51,553 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-04 12:02:51,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-04 12:02:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-04 12:02:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-04 12:02:51,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:51,554 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2018-12-04 12:02:51,554 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:51,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2018-12-04 12:02:51,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:51,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:51,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:51,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:51,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-04 12:02:54,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:54,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:54,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:54,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:54,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:54,115 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-04 12:02:54,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:54,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:02:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:54,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-04 12:02:54,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-04 12:03:01,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:01,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-04 12:03:01,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:01,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-04 12:03:01,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-04 12:03:01,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-04 12:03:01,509 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-12-04 12:03:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:02,337 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2018-12-04 12:03:02,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-04 12:03:02,338 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-12-04 12:03:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:02,339 INFO L225 Difference]: With dead ends: 247 [2018-12-04 12:03:02,339 INFO L226 Difference]: Without dead ends: 165 [2018-12-04 12:03:02,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-04 12:03:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-04 12:03:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-04 12:03:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-04 12:03:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-04 12:03:02,343 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-04 12:03:02,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:02,343 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-04 12:03:02,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-04 12:03:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-04 12:03:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-04 12:03:02,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:02,344 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2018-12-04 12:03:02,345 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:02,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:02,345 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2018-12-04 12:03:02,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:02,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:02,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:04,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-04 12:03:04,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:04,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:04,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:04,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:04,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:04,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 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-04 12:03:04,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:03:04,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:03:08,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-04 12:03:08,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:08,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-04 12:03:08,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:15,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-04 12:03:15,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:15,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-04 12:03:15,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:15,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-04 12:03:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-04 12:03:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 12:03:15,491 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2018-12-04 12:03:16,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:16,346 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-12-04 12:03:16,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-04 12:03:16,346 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-12-04 12:03:16,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:16,347 INFO L225 Difference]: With dead ends: 250 [2018-12-04 12:03:16,347 INFO L226 Difference]: Without dead ends: 167 [2018-12-04 12:03:16,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 12:03:16,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-04 12:03:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-04 12:03:16,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-04 12:03:16,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-12-04 12:03:16,351 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-12-04 12:03:16,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:16,351 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-12-04 12:03:16,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-04 12:03:16,351 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-12-04 12:03:16,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-04 12:03:16,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:16,352 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2018-12-04 12:03:16,352 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:16,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:16,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2018-12-04 12:03:16,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:16,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:16,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:16,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:16,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-04 12:03:19,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:19,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:19,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:19,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:19,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:19,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 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-04 12:03:19,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:03:19,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:03:19,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:03:19,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:19,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-04 12:03:19,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-04 12:03:26,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:26,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-04 12:03:26,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:26,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-04 12:03:26,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-04 12:03:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 12:03:26,662 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-12-04 12:03:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:27,333 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2018-12-04 12:03:27,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-04 12:03:27,334 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-12-04 12:03:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:27,334 INFO L225 Difference]: With dead ends: 253 [2018-12-04 12:03:27,334 INFO L226 Difference]: Without dead ends: 169 [2018-12-04 12:03:27,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 12:03:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-04 12:03:27,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-04 12:03:27,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-04 12:03:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-04 12:03:27,338 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-12-04 12:03:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:27,338 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-04 12:03:27,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-04 12:03:27,339 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-04 12:03:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-04 12:03:27,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:27,339 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2018-12-04 12:03:27,339 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:27,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:27,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2018-12-04 12:03:27,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:27,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:27,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:27,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:27,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-04 12:03:29,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:29,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:29,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:29,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:29,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:29,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 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-04 12:03:29,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:29,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:03:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:29,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-04 12:03:29,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-04 12:03:37,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:37,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-04 12:03:37,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:37,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-04 12:03:37,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-04 12:03:37,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-04 12:03:37,704 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2018-12-04 12:03:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:38,590 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2018-12-04 12:03:38,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-04 12:03:38,590 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-12-04 12:03:38,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:38,591 INFO L225 Difference]: With dead ends: 256 [2018-12-04 12:03:38,591 INFO L226 Difference]: Without dead ends: 171 [2018-12-04 12:03:38,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-04 12:03:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-04 12:03:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-04 12:03:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-04 12:03:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-04 12:03:38,595 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-04 12:03:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:38,595 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-04 12:03:38,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-04 12:03:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-04 12:03:38,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-04 12:03:38,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:38,596 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2018-12-04 12:03:38,596 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:38,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2018-12-04 12:03:38,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:38,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:38,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:38,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:41,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-04 12:03:41,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:41,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:41,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:41,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:41,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:41,417 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-04 12:03:41,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:03:41,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:03:51,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-04 12:03:51,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:51,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-04 12:03:51,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-04 12:03:58,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:58,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-04 12:03:58,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:58,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-04 12:03:58,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-04 12:03:58,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-04 12:03:58,992 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-12-04 12:03:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:59,957 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2018-12-04 12:03:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-04 12:03:59,958 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-12-04 12:03:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:59,958 INFO L225 Difference]: With dead ends: 259 [2018-12-04 12:03:59,958 INFO L226 Difference]: Without dead ends: 173 [2018-12-04 12:03:59,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-04 12:03:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-04 12:03:59,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-04 12:03:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-04 12:03:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-12-04 12:03:59,963 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-12-04 12:03:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:59,963 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-12-04 12:03:59,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-04 12:03:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-12-04 12:03:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-04 12:03:59,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:59,964 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2018-12-04 12:03:59,964 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:59,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:59,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2018-12-04 12:03:59,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:59,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:59,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:59,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-04 12:04:02,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:02,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:02,790 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:02,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:02,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:02,790 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-04 12:04:02,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:04:02,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:04:02,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:04:02,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:02,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-04 12:04:02,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-04 12:04:10,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:10,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-04 12:04:10,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:10,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-04 12:04:10,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-04 12:04:10,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 12:04:10,642 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2018-12-04 12:04:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:11,628 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2018-12-04 12:04:11,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-04 12:04:11,629 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-12-04 12:04:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:11,629 INFO L225 Difference]: With dead ends: 262 [2018-12-04 12:04:11,629 INFO L226 Difference]: Without dead ends: 175 [2018-12-04 12:04:11,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-04 12:04:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-04 12:04:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-04 12:04:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-04 12:04:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-04 12:04:11,635 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-12-04 12:04:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:11,635 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-04 12:04:11,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-04 12:04:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-04 12:04:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-04 12:04:11,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:11,636 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2018-12-04 12:04:11,636 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:11,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:11,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2018-12-04 12:04:11,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:11,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:11,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:11,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:11,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-04 12:04:14,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:14,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:14,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:14,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:14,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:14,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 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-04 12:04:14,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:04:14,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:04:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:14,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-04 12:04:14,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-04 12:04:22,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:22,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-04 12:04:22,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:22,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-04 12:04:22,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-04 12:04:22,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 12:04:22,833 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-12-04 12:04:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:23,809 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-12-04 12:04:23,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-04 12:04:23,809 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-12-04 12:04:23,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:23,810 INFO L225 Difference]: With dead ends: 265 [2018-12-04 12:04:23,810 INFO L226 Difference]: Without dead ends: 177 [2018-12-04 12:04:23,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 12:04:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-04 12:04:23,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-04 12:04:23,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-04 12:04:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-04 12:04:23,814 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-04 12:04:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:23,815 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-04 12:04:23,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-04 12:04:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-04 12:04:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-04 12:04:23,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:23,816 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2018-12-04 12:04:23,816 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:23,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:23,817 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2018-12-04 12:04:23,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:23,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:23,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:04:23,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:23,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-04 12:04:26,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:26,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:26,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:26,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:26,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:26,522 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-04 12:04:26,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:04:26,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:04:36,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-04 12:04:36,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:36,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-04 12:04:36,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-04 12:04:45,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:45,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-04 12:04:45,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:45,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 12:04:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 12:04:45,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-04 12:04:45,414 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2018-12-04 12:04:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:46,317 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2018-12-04 12:04:46,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-04 12:04:46,318 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-12-04 12:04:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:46,319 INFO L225 Difference]: With dead ends: 268 [2018-12-04 12:04:46,319 INFO L226 Difference]: Without dead ends: 179 [2018-12-04 12:04:46,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-04 12:04:46,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-04 12:04:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-04 12:04:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-04 12:04:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-12-04 12:04:46,324 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-12-04 12:04:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:46,325 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-12-04 12:04:46,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 12:04:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-12-04 12:04:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-04 12:04:46,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:46,325 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2018-12-04 12:04:46,326 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:46,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:46,326 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2018-12-04 12:04:46,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:46,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:46,327 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-04 12:04:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:49,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:49,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:49,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:49,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:49,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 12:04:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:04:49,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:04:49,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:04:49,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:49,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-04 12:04:49,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-04 12:04:58,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:58,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-04 12:04:58,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:58,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-04 12:04:58,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-04 12:04:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 12:04:58,154 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-12-04 12:04:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:59,239 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2018-12-04 12:04:59,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-04 12:04:59,240 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-12-04 12:04:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:59,240 INFO L225 Difference]: With dead ends: 271 [2018-12-04 12:04:59,241 INFO L226 Difference]: Without dead ends: 181 [2018-12-04 12:04:59,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-04 12:04:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-04 12:04:59,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-04 12:04:59,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-04 12:04:59,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-04 12:04:59,245 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-12-04 12:04:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:59,245 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-04 12:04:59,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-04 12:04:59,245 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-04 12:04:59,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-04 12:04:59,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:59,246 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2018-12-04 12:04:59,246 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:59,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:59,246 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2018-12-04 12:04:59,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:59,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:59,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:59,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-04 12:05:02,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:02,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:02,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:02,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:02,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:02,075 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-04 12:05:02,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:02,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:05:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:02,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-04 12:05:02,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-04 12:05:11,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:11,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-04 12:05:11,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:11,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-04 12:05:11,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-04 12:05:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-04 12:05:11,037 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2018-12-04 12:05:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:11,950 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2018-12-04 12:05:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-04 12:05:11,950 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-12-04 12:05:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:11,951 INFO L225 Difference]: With dead ends: 274 [2018-12-04 12:05:11,951 INFO L226 Difference]: Without dead ends: 183 [2018-12-04 12:05:11,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-04 12:05:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-04 12:05:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-04 12:05:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-04 12:05:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-04 12:05:11,955 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-04 12:05:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:11,955 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-04 12:05:11,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-04 12:05:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-04 12:05:11,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-04 12:05:11,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:11,956 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2018-12-04 12:05:11,956 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:11,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2018-12-04 12:05:11,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:11,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:11,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-04 12:05:15,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:15,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:15,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:15,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:15,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:15,156 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-04 12:05:15,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:05:15,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:05:20,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-04 12:05:20,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:20,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-04 12:05:20,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-04 12:05:29,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:29,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-04 12:05:29,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:29,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-04 12:05:29,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-04 12:05:29,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 12:05:29,608 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-12-04 12:05:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:30,484 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2018-12-04 12:05:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-04 12:05:30,485 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-12-04 12:05:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:30,485 INFO L225 Difference]: With dead ends: 277 [2018-12-04 12:05:30,486 INFO L226 Difference]: Without dead ends: 185 [2018-12-04 12:05:30,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 12:05:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-04 12:05:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-04 12:05:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-04 12:05:30,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-12-04 12:05:30,490 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-12-04 12:05:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:30,491 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-12-04 12:05:30,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-04 12:05:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-12-04 12:05:30,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-04 12:05:30,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:30,492 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2018-12-04 12:05:30,492 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:30,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:30,492 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2018-12-04 12:05:30,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:30,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:30,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:30,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-04 12:05:33,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:33,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:33,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:33,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:33,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:33,891 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-04 12:05:33,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:05:33,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:05:34,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:05:34,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:34,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:34,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-04 12:05:34,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-04 12:05:43,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:43,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-04 12:05:43,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:43,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-04 12:05:43,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-04 12:05:43,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 12:05:43,011 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2018-12-04 12:05:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:43,913 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-12-04 12:05:43,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-04 12:05:43,914 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-12-04 12:05:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:43,915 INFO L225 Difference]: With dead ends: 280 [2018-12-04 12:05:43,915 INFO L226 Difference]: Without dead ends: 187 [2018-12-04 12:05:43,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 12:05:43,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-04 12:05:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-04 12:05:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-04 12:05:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-04 12:05:43,920 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-12-04 12:05:43,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:43,921 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-04 12:05:43,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-04 12:05:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-04 12:05:43,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-04 12:05:43,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:43,922 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2018-12-04 12:05:43,922 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:43,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2018-12-04 12:05:43,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:43,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:43,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:43,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-04 12:05:46,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:46,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:46,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:46,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:46,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:46,981 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-04 12:05:46,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:46,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:05:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:47,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-04 12:05:47,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:56,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-04 12:05:56,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:56,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-04 12:05:56,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:56,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-04 12:05:56,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-04 12:05:56,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-04 12:05:56,566 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-12-04 12:05:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:57,860 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2018-12-04 12:05:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-04 12:05:57,860 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-12-04 12:05:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:57,861 INFO L225 Difference]: With dead ends: 283 [2018-12-04 12:05:57,861 INFO L226 Difference]: Without dead ends: 189 [2018-12-04 12:05:57,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-04 12:05:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-04 12:05:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-04 12:05:57,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-04 12:05:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-04 12:05:57,866 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-04 12:05:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:57,866 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-04 12:05:57,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-04 12:05:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-04 12:05:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-04 12:05:57,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:57,867 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2018-12-04 12:05:57,868 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:57,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2018-12-04 12:05:57,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:57,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:57,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:01,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-04 12:06:01,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:01,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:01,234 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:01,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:01,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:01,234 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-04 12:06:01,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:06:01,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:06:07,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-04 12:06:07,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:07,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-04 12:06:07,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-04 12:06:16,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:16,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-04 12:06:16,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:16,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 12:06:16,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 12:06:16,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-04 12:06:16,481 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2018-12-04 12:06:17,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:17,564 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2018-12-04 12:06:17,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-04 12:06:17,564 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-12-04 12:06:17,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:17,565 INFO L225 Difference]: With dead ends: 286 [2018-12-04 12:06:17,565 INFO L226 Difference]: Without dead ends: 191 [2018-12-04 12:06:17,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-04 12:06:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-04 12:06:17,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-04 12:06:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-04 12:06:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-12-04 12:06:17,569 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-12-04 12:06:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:17,570 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-12-04 12:06:17,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 12:06:17,570 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-12-04 12:06:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-04 12:06:17,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:17,571 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2018-12-04 12:06:17,571 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:17,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2018-12-04 12:06:17,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:17,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:17,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:06:17,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:17,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-04 12:06:20,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:20,965 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:20,965 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:20,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:20,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:20,966 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-04 12:06:20,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:06:20,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:06:21,112 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:06:21,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:21,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-04 12:06:21,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-04 12:06:30,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:30,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-04 12:06:30,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:30,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-04 12:06:30,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-04 12:06:30,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 12:06:30,837 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-12-04 12:06:32,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:32,193 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2018-12-04 12:06:32,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-04 12:06:32,194 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-12-04 12:06:32,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:32,194 INFO L225 Difference]: With dead ends: 289 [2018-12-04 12:06:32,194 INFO L226 Difference]: Without dead ends: 193 [2018-12-04 12:06:32,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 12:06:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-04 12:06:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-04 12:06:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-04 12:06:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-04 12:06:32,199 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-12-04 12:06:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:32,199 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-04 12:06:32,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-04 12:06:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-04 12:06:32,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-04 12:06:32,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:32,200 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2018-12-04 12:06:32,200 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:32,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:32,200 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2018-12-04 12:06:32,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:32,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:06:32,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:32,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:35,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-04 12:06:35,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:35,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:35,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:35,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:35,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:35,734 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-04 12:06:35,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:35,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:06:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:35,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-04 12:06:35,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:45,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-04 12:06:45,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:45,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-04 12:06:45,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:45,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-04 12:06:45,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-04 12:06:45,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-04 12:06:45,761 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2018-12-04 12:06:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:47,110 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2018-12-04 12:06:47,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-04 12:06:47,110 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-12-04 12:06:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:47,111 INFO L225 Difference]: With dead ends: 292 [2018-12-04 12:06:47,111 INFO L226 Difference]: Without dead ends: 195 [2018-12-04 12:06:47,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-04 12:06:47,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-04 12:06:47,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-04 12:06:47,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-04 12:06:47,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-04 12:06:47,116 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-04 12:06:47,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:47,116 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-04 12:06:47,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-04 12:06:47,117 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-04 12:06:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-04 12:06:47,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:47,118 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2018-12-04 12:06:47,118 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:47,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:47,118 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2018-12-04 12:06:47,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:47,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:47,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:47,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:47,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-04 12:06:50,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:50,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:50,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:50,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:50,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:50,642 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-04 12:06:50,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:06:50,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:06:57,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-04 12:06:57,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:57,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-04 12:06:57,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-04 12:07:07,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:07,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-04 12:07:07,904 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:07,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-04 12:07:07,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-04 12:07:07,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 12:07:07,906 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-12-04 12:07:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:09,444 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-12-04 12:07:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-04 12:07:09,445 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-12-04 12:07:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:09,445 INFO L225 Difference]: With dead ends: 295 [2018-12-04 12:07:09,445 INFO L226 Difference]: Without dead ends: 197 [2018-12-04 12:07:09,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 12:07:09,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-04 12:07:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-04 12:07:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-04 12:07:09,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-12-04 12:07:09,450 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-12-04 12:07:09,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:09,450 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-12-04 12:07:09,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-04 12:07:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-12-04 12:07:09,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-04 12:07:09,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:09,452 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2018-12-04 12:07:09,452 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:09,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:09,452 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2018-12-04 12:07:09,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:09,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:07:09,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:09,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-04 12:07:13,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:13,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:13,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:13,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:13,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:13,127 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-04 12:07:13,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:07:13,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:07:13,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:07:13,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:07:13,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-04 12:07:13,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-04 12:07:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:23,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-04 12:07:23,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:23,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-04 12:07:23,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-04 12:07:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 12:07:23,713 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2018-12-04 12:07:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:25,284 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-12-04 12:07:25,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-04 12:07:25,284 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-12-04 12:07:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:25,285 INFO L225 Difference]: With dead ends: 298 [2018-12-04 12:07:25,285 INFO L226 Difference]: Without dead ends: 199 [2018-12-04 12:07:25,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 12:07:25,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-04 12:07:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-04 12:07:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-04 12:07:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-12-04 12:07:25,289 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-12-04 12:07:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:25,289 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-12-04 12:07:25,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-04 12:07:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-12-04 12:07:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-04 12:07:25,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:25,290 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2018-12-04 12:07:25,290 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:25,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:25,291 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2018-12-04 12:07:25,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:25,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:25,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:07:25,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:25,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-04 12:07:29,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:29,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:29,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:29,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:29,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:29,079 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-04 12:07:29,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:07:29,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:07:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:29,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-04 12:07:29,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:39,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-04 12:07:39,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:39,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-04 12:07:39,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:39,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-04 12:07:39,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-04 12:07:39,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 12:07:39,654 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-12-04 12:07:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:40,871 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2018-12-04 12:07:40,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-04 12:07:40,871 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-12-04 12:07:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:40,872 INFO L225 Difference]: With dead ends: 301 [2018-12-04 12:07:40,872 INFO L226 Difference]: Without dead ends: 201 [2018-12-04 12:07:40,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 12:07:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-04 12:07:40,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-04 12:07:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-04 12:07:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-04 12:07:40,876 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-12-04 12:07:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:40,876 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-04 12:07:40,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-04 12:07:40,877 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-04 12:07:40,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-04 12:07:40,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:40,877 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2018-12-04 12:07:40,877 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:40,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2018-12-04 12:07:40,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:40,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:07:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:40,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-04 12:07:44,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:44,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:44,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:44,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:44,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:44,623 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-04 12:07:44,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:07:44,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:08:01,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-04 12:08:01,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:08:01,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:01,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-04 12:08:01,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-04 12:08:11,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:11,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-04 12:08:11,921 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:11,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 12:08:11,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 12:08:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-04 12:08:11,923 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2018-12-04 12:08:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:13,492 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2018-12-04 12:08:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-04 12:08:13,492 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-12-04 12:08:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:13,493 INFO L225 Difference]: With dead ends: 304 [2018-12-04 12:08:13,493 INFO L226 Difference]: Without dead ends: 203 [2018-12-04 12:08:13,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-04 12:08:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-04 12:08:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-04 12:08:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-04 12:08:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-12-04 12:08:13,497 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-12-04 12:08:13,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:13,497 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-12-04 12:08:13,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 12:08:13,497 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-12-04 12:08:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-04 12:08:13,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:13,498 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2018-12-04 12:08:13,498 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:13,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:13,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2018-12-04 12:08:13,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:13,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:08:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:13,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:17,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-04 12:08:17,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:17,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:17,034 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:17,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:17,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:17,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 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-04 12:08:17,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:08:17,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:08:17,189 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:08:17,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:08:17,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-04 12:08:17,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-04 12:08:28,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:28,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-04 12:08:28,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:28,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-04 12:08:28,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-04 12:08:28,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 12:08:28,385 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-12-04 12:08:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:30,060 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2018-12-04 12:08:30,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-04 12:08:30,060 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-12-04 12:08:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:30,061 INFO L225 Difference]: With dead ends: 307 [2018-12-04 12:08:30,061 INFO L226 Difference]: Without dead ends: 205 [2018-12-04 12:08:30,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-04 12:08:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-04 12:08:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-04 12:08:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-04 12:08:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-04 12:08:30,065 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-12-04 12:08:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:30,066 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-04 12:08:30,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-04 12:08:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-04 12:08:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-04 12:08:30,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:30,066 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2018-12-04 12:08:30,067 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:30,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:30,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2018-12-04 12:08:30,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:30,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:30,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:08:30,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:30,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-04 12:08:33,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:33,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:33,964 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:33,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:33,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:33,965 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-04 12:08:33,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:08:33,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:08:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:34,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:34,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-04 12:08:34,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-04 12:08:45,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:45,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-04 12:08:45,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:45,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-04 12:08:45,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-04 12:08:45,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 12:08:45,250 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2018-12-04 12:08:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:46,864 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2018-12-04 12:08:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-04 12:08:46,864 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-12-04 12:08:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:46,865 INFO L225 Difference]: With dead ends: 310 [2018-12-04 12:08:46,866 INFO L226 Difference]: Without dead ends: 207 [2018-12-04 12:08:46,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-04 12:08:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-04 12:08:46,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-04 12:08:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-04 12:08:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-12-04 12:08:46,871 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-12-04 12:08:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:46,871 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-12-04 12:08:46,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-04 12:08:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-12-04 12:08:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-04 12:08:46,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:46,872 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2018-12-04 12:08:46,873 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:46,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2018-12-04 12:08:46,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:46,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:08:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:46,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-04 12:08:50,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:50,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:50,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:50,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:50,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:50,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 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-04 12:08:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:08:50,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:09:12,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-04 12:09:12,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:09:12,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:12,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-04 12:09:12,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:09:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-04 12:09:23,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:09:23,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-04 12:09:23,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:09:23,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-04 12:09:23,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-04 12:09:23,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 12:09:23,510 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-12-04 12:09:25,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:09:25,348 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2018-12-04 12:09:25,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-04 12:09:25,348 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-12-04 12:09:25,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:09:25,349 INFO L225 Difference]: With dead ends: 313 [2018-12-04 12:09:25,349 INFO L226 Difference]: Without dead ends: 209 [2018-12-04 12:09:25,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 12:09:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-04 12:09:25,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-12-04 12:09:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-04 12:09:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-12-04 12:09:25,355 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-12-04 12:09:25,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:09:25,355 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-12-04 12:09:25,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-04 12:09:25,355 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-12-04 12:09:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-04 12:09:25,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:09:25,356 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2018-12-04 12:09:25,357 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:09:25,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:09:25,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2018-12-04 12:09:25,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:09:25,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:25,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:09:25,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:25,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:09:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:29,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-04 12:09:29,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:29,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:09:29,467 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:09:29,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:09:29,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:29,467 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-04 12:09:29,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:09:29,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:09:29,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:09:29,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:09:29,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-04 12:09:29,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:09:40,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-04 12:09:41,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:09:41,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-04 12:09:41,016 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:09:41,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-04 12:09:41,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-04 12:09:41,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 12:09:41,018 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2018-12-04 12:09:42,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:09:42,488 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2018-12-04 12:09:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-04 12:09:42,489 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-12-04 12:09:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:09:42,489 INFO L225 Difference]: With dead ends: 316 [2018-12-04 12:09:42,489 INFO L226 Difference]: Without dead ends: 211 [2018-12-04 12:09:42,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-04 12:09:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-04 12:09:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-04 12:09:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-04 12:09:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-04 12:09:42,495 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-12-04 12:09:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:09:42,495 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-04 12:09:42,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-04 12:09:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-04 12:09:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-04 12:09:42,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:09:42,496 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2018-12-04 12:09:42,496 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:09:42,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:09:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2018-12-04 12:09:42,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:09:42,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:42,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:09:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:42,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:09:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-04 12:09:46,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:46,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:09:46,301 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:09:46,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:09:46,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:46,302 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-04 12:09:46,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:09:46,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:09:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:46,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-04 12:09:46,494 INFO L316 TraceCheckSpWp]: Computing backward predicates...