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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:51:27,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:51:27,719 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:51:27,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:51:27,737 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:51:27,740 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:51:27,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:51:27,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:51:27,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:51:27,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:51:27,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:51:27,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:51:27,751 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:51:27,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:51:27,755 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:51:27,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:51:27,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:51:27,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:51:27,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:51:27,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:51:27,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:51:27,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:51:27,779 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:51:27,779 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:51:27,779 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:51:27,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:51:27,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:51:27,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:51:27,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:51:27,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:51:27,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:51:27,785 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:51:27,785 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:51:27,786 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:51:27,787 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:51:27,787 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:51:27,787 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:51:27,807 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:51:27,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:51:27,808 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:51:27,808 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:51:27,808 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:51:27,808 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:51:27,809 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:51:27,809 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:51:27,809 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:51:27,809 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:51:27,809 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:51:27,810 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:51:27,810 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:51:27,810 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:51:27,811 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:51:27,811 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:51:27,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:51:27,811 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:51:27,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:51:27,812 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:51:27,812 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:51:27,812 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:51:27,814 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:51:27,814 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:51:27,814 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:51:27,814 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:51:27,815 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:51:27,815 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:51:27,815 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:51:27,815 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:51:27,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:51:27,816 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:51:27,816 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:51:27,816 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:51:27,816 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:51:27,817 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:51:27,817 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:51:27,817 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:51:27,817 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:51:27,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:51:27,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:51:27,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:51:27,882 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:51:27,883 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:51:27,883 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl [2018-12-03 17:51:27,884 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/overflow1.i_3.bpl' [2018-12-03 17:51:27,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:51:27,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:51:27,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:51:27,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:51:27,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:51:27,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:27,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:27,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:51:27,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:51:27,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:51:27,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:51:27,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:27,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:27,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:27,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:27,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:28,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:28,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... [2018-12-03 17:51:28,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:51:28,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:51:28,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:51:28,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:51:28,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:51:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:51:28,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:51:28,333 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:51:28,334 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:51:28,334 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:51:28 BoogieIcfgContainer [2018-12-03 17:51:28,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:51:28,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:51:28,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:51:28,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:51:28,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:51:27" (1/2) ... [2018-12-03 17:51:28,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f526c4 and model type overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:51:28, skipping insertion in model container [2018-12-03 17:51:28,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:51:28" (2/2) ... [2018-12-03 17:51:28,348 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow1.i_3.bpl [2018-12-03 17:51:28,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:51:28,368 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:51:28,386 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:51:28,419 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:51:28,419 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:51:28,420 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:51:28,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:51:28,420 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:51:28,420 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:51:28,420 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:51:28,421 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:51:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:51:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:51:28,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:28,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:51:28,454 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:28,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:28,464 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 17:51:28,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:28,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:28,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:28,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:28,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:28,834 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:51:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:28,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:51:28,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:51:28,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:51:28,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:51:28,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:51:28,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:51:28,867 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 17:51:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:28,919 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:51:28,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:51:28,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:51:28,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:28,934 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:51:28,934 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 17:51:28,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:51:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 17:51:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 17:51:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 17:51:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 17:51:28,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 17:51:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:28,974 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 17:51:28,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:51:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 17:51:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:51:28,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:28,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:51:28,976 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:28,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 17:51:28,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:28,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:28,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:28,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:28,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:29,496 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:51:29,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:29,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:29,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:29,501 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 17:51:29,503 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 17:51:29,564 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:51:29,565 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:51:29,663 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:51:30,165 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:51:30,167 INFO L272 AbstractInterpreter]: Visited 4 different actions 23 times. Merged at 3 different actions 17 times. Widened at 2 different actions 5 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:51:30,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:30,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:51:30,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:30,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:30,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:30,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:51:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:30,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:30,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:30,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:30,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 17:51:30,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:30,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:51:30,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:51:30,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:51:30,527 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 17:51:30,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:30,570 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:51:30,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:51:30,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 17:51:30,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:30,572 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:51:30,572 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:51:30,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 17:51:30,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:51:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:51:30,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:51:30,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 17:51:30,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-12-03 17:51:30,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:30,577 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 17:51:30,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:51:30,577 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 17:51:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:51:30,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:30,579 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 17:51:30,579 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:30,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 2 times [2018-12-03 17:51:30,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:30,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:30,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:30,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:30,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:31,024 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:51:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:31,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:31,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:31,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:31,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:31,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:31,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:31,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:51:31,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:51:31,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 17:51:31,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:31,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:31,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:31,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:31,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 17:51:31,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:31,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:51:31,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:51:31,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:51:31,276 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 17:51:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:31,444 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 17:51:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:51:31,445 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 17:51:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:31,445 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:51:31,446 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:51:31,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:51:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:51:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:51:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:51:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 17:51:31,450 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-12-03 17:51:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:31,450 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 17:51:31,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:51:31,451 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 17:51:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:51:31,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:31,451 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 17:51:31,451 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:31,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:31,452 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 3 times [2018-12-03 17:51:31,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:31,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:31,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:31,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:31,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:31,641 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:31,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:31,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:31,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:31,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:31,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:31,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:31,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:51:31,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:51:31,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:51:31,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:31,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:31,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:32,259 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:32,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:32,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 17:51:32,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:32,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:51:32,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:51:32,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:51:32,282 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 17:51:32,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:32,340 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 17:51:32,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:51:32,341 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 17:51:32,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:32,341 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:51:32,341 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:51:32,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:51:32,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:51:32,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:51:32,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:51:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 17:51:32,346 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-12-03 17:51:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:32,346 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 17:51:32,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:51:32,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 17:51:32,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:51:32,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:32,347 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 17:51:32,347 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:32,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 4 times [2018-12-03 17:51:32,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:32,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:32,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:32,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:32,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:32,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:32,591 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:32,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:32,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:32,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:32,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:32,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:51:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:32,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:32,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:32,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:32,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 17:51:32,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:32,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:51:32,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:51:32,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:51:32,977 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 17:51:33,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:33,152 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 17:51:33,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:51:33,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 17:51:33,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:33,155 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:51:33,155 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:51:33,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:51:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:51:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:51:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:51:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 17:51:33,160 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-12-03 17:51:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:33,161 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 17:51:33,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:51:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 17:51:33,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:51:33,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:33,162 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 17:51:33,162 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:33,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:33,162 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 5 times [2018-12-03 17:51:33,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:33,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:33,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:33,499 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:33,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:33,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:33,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:33,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:33,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:33,501 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:33,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:51:33,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:51:33,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:51:33,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:33,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:33,614 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:33,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:34,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:34,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 17:51:34,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:34,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:51:34,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:51:34,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:51:34,042 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 17:51:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:34,175 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-03 17:51:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:51:34,176 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 17:51:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:34,177 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:51:34,177 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:51:34,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:51:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:51:34,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:51:34,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:51:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 17:51:34,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-12-03 17:51:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:34,183 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 17:51:34,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:51:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 17:51:34,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:51:34,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:34,184 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 17:51:34,184 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:34,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:34,185 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 6 times [2018-12-03 17:51:34,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:34,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:34,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:34,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:34,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:34,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:34,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:34,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:34,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:34,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:34,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:51:34,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:51:34,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:51:34,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:34,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:34,559 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:34,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:34,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:34,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 17:51:34,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:34,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:51:34,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:51:34,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:51:34,965 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 17:51:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:35,169 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-03 17:51:35,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:51:35,171 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 17:51:35,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:35,172 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:51:35,172 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:51:35,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:51:35,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:51:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:51:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:51:35,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 17:51:35,177 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-12-03 17:51:35,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:35,178 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 17:51:35,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:51:35,178 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 17:51:35,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:51:35,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:35,179 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 17:51:35,179 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:35,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 7 times [2018-12-03 17:51:35,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:35,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:35,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:35,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:35,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:35,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:35,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:35,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:35,633 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:35,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:35,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:51:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:35,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:35,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:36,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:36,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 17:51:36,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:36,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:51:36,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:51:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:51:36,438 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 17:51:36,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:36,616 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 17:51:36,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:51:36,621 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 17:51:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:36,622 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:51:36,622 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:51:36,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:51:36,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:51:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:51:36,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:51:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 17:51:36,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-12-03 17:51:36,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:36,629 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 17:51:36,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:51:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 17:51:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:51:36,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:36,630 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 17:51:36,630 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:36,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 8 times [2018-12-03 17:51:36,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:36,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:36,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:36,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:36,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:37,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:37,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:37,047 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:37,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:37,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:37,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:37,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:51:37,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:51:40,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 17:51:40,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:40,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:40,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:41,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:41,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 17:51:41,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:41,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:51:41,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:51:41,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:51:41,046 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 17:51:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:41,344 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-03 17:51:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:51:41,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 17:51:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:41,345 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:51:41,345 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:51:41,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=865, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:51:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:51:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:51:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:51:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 17:51:41,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-12-03 17:51:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:41,351 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 17:51:41,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:51:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 17:51:41,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:51:41,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:41,353 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 17:51:41,353 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:41,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 9 times [2018-12-03 17:51:41,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:41,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:41,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:41,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:41,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:41,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:41,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:41,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:41,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:41,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:41,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:41,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:51:41,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:51:41,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:51:41,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:41,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:41,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:42,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:42,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 17:51:42,753 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:42,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:51:42,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:51:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:51:42,755 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 17:51:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:43,154 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-03 17:51:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:51:43,154 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 17:51:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:43,156 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:51:43,156 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:51:43,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:51:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:51:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:51:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:51:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 17:51:43,163 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-12-03 17:51:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:43,163 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 17:51:43,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:51:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 17:51:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:51:43,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:43,164 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 17:51:43,165 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:43,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:43,165 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 10 times [2018-12-03 17:51:43,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:43,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:43,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:43,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:44,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:44,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:44,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:44,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:44,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:44,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:44,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:44,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:51:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:44,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:44,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:45,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:45,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 17:51:45,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:45,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:51:45,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:51:45,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:51:45,072 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 17:51:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:45,452 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 17:51:45,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:51:45,453 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 17:51:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:45,454 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:51:45,454 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:51:45,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=485, Invalid=1321, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:51:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:51:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:51:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:51:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 17:51:45,461 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-12-03 17:51:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:45,462 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 17:51:45,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:51:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 17:51:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:51:45,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:45,463 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 17:51:45,463 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:45,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:45,463 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 11 times [2018-12-03 17:51:45,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:45,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:45,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:45,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:46,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:46,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:46,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:46,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:46,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:46,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:46,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:51:46,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:51:46,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 17:51:46,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:46,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:46,714 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:46,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:47,735 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:47,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:47,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 17:51:47,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:47,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:51:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:51:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1585, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:51:47,762 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 17:51:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:48,194 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-12-03 17:51:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:51:48,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 17:51:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:48,196 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:51:48,197 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:51:48,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=577, Invalid=1585, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:51:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:51:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:51:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:51:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 17:51:48,205 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-12-03 17:51:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:48,205 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 17:51:48,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:51:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 17:51:48,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:51:48,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:48,207 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 17:51:48,207 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:48,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:48,207 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 12 times [2018-12-03 17:51:48,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:48,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:48,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:48,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:48,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:48,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:48,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:48,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:48,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:48,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:48,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:48,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:48,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:51:48,922 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:51:48,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:51:48,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:48,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:49,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:51,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:51,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 17:51:51,436 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:51,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:51:51,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:51:51,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=1873, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:51:51,438 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 17:51:51,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:51,887 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-03 17:51:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:51:51,888 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 17:51:51,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:51,889 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:51:51,889 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:51:51,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=677, Invalid=1873, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:51:51,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:51:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:51:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:51:51,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 17:51:51,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-12-03 17:51:51,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:51,896 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 17:51:51,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:51:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 17:51:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:51:51,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:51,897 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 17:51:51,897 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:51,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 13 times [2018-12-03 17:51:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:51,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:51,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:51,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:51,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:52,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:52,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:52,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:52,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:52,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:52,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:52,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:52,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:51:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:52,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:52,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:54,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:54,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 17:51:54,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:54,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:51:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:51:54,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:51:54,962 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 17:51:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:55,458 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 17:51:55,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:51:55,460 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 17:51:55,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:55,461 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:51:55,462 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:51:55,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:51:55,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:51:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:51:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:51:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 17:51:55,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-12-03 17:51:55,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:55,468 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 17:51:55,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:51:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 17:51:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:51:55,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:55,469 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 17:51:55,469 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:55,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:55,470 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 14 times [2018-12-03 17:51:55,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:55,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:55,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:56,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:56,101 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:56,101 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:56,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:56,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:56,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:56,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:51:56,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:52:56,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 17:52:56,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:52:57,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:52:57,218 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:57,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:52:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:59,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:52:59,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 17:52:59,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:52:59,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:52:59,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:52:59,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=901, Invalid=2521, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:52:59,049 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 17:52:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:52:59,935 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-03 17:52:59,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:52:59,937 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 17:52:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:52:59,938 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:52:59,938 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:52:59,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=901, Invalid=2521, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:52:59,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:52:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:52:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:52:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 17:52:59,952 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-12-03 17:52:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:52:59,953 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 17:52:59,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:52:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 17:52:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:52:59,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:52:59,954 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 17:52:59,954 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:52:59,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:52:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 15 times [2018-12-03 17:52:59,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:52:59,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:59,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:52:59,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:59,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:52:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:00,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:00,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:53:00,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:53:00,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:53:00,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:00,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:53:00,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:53:00,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:53:00,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:53:00,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:53:00,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:53:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:00,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:53:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:02,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:53:02,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 17:53:02,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:53:02,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:53:02,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:53:02,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1025, Invalid=2881, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:53:02,828 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 17:53:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:03,640 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-03 17:53:03,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:53:03,641 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 17:53:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:03,642 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:53:03,642 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:53:03,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1025, Invalid=2881, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:53:03,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:53:03,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 17:53:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:53:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 17:53:03,650 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-12-03 17:53:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:03,650 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 17:53:03,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:53:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 17:53:03,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:53:03,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:03,652 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 17:53:03,652 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:03,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:03,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 16 times [2018-12-03 17:53:03,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:03,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:03,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:53:03,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:03,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:04,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:04,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:53:04,377 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:53:04,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:53:04,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:04,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:53:04,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:04,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:53:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:04,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:53:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:04,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:53:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:06,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:53:06,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 17:53:06,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:53:06,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:53:06,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:53:06,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1157, Invalid=3265, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:53:06,669 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 17:53:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:53:07,405 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 17:53:07,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:53:07,407 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 17:53:07,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:53:07,408 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:53:07,408 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:53:07,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3265, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:53:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:53:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:53:07,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:53:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 17:53:07,415 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-12-03 17:53:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:53:07,415 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 17:53:07,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:53:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 17:53:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:53:07,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:53:07,416 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 17:53:07,416 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:53:07,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:53:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 17 times [2018-12-03 17:53:07,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:53:07,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:07,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:53:07,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:53:07,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:53:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:53:08,196 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:53:08,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:08,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:53:08,197 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:53:08,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:53:08,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:53:08,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:53:08,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:53:08,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:55:14,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 17:55:14,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:55:16,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:55:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:16,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:55:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:18,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:55:18,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2018-12-03 17:55:18,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:55:18,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:55:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:55:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1297, Invalid=3673, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:55:18,835 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-12-03 17:55:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:19,630 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-12-03 17:55:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:55:19,631 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-12-03 17:55:19,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:19,632 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:55:19,632 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:55:19,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1297, Invalid=3673, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:55:19,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:55:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 17:55:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:55:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 17:55:19,641 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-12-03 17:55:19,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:19,641 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 17:55:19,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:55:19,642 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 17:55:19,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:55:19,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:19,642 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 17:55:19,643 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:19,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:19,643 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 18 times [2018-12-03 17:55:19,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:19,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:55:19,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:19,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:20,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:20,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:55:20,807 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:55:20,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:55:20,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:20,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:55:20,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:55:20,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:55:20,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:55:20,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:55:20,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:55:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:20,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:55:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:23,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:55:23,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2018-12-03 17:55:23,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:55:23,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:55:23,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:55:23,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1445, Invalid=4105, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:55:23,581 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-12-03 17:55:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:24,555 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-03 17:55:24,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:55:24,555 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-12-03 17:55:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:24,556 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:55:24,556 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:55:24,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1445, Invalid=4105, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:55:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:55:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 17:55:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:55:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 17:55:24,564 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-12-03 17:55:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:24,564 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 17:55:24,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:55:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 17:55:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:55:24,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:24,565 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 17:55:24,565 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:24,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:24,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 19 times [2018-12-03 17:55:24,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:24,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:24,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:55:24,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:24,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:25,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:25,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:55:25,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:55:25,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:55:25,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:25,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:55:25,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:25,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:55:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:25,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:55:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:25,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:55:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:28,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:55:28,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2018-12-03 17:55:28,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:55:28,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:55:28,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:55:28,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:55:28,760 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-12-03 17:55:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:29,740 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 17:55:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:55:29,741 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-12-03 17:55:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:29,741 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:55:29,742 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:55:29,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1601, Invalid=4561, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:55:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:55:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:55:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:55:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 17:55:29,748 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-12-03 17:55:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:29,749 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 17:55:29,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:55:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 17:55:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:55:29,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:29,750 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 17:55:29,750 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:29,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:29,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 20 times [2018-12-03 17:55:29,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:29,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:29,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:30,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:30,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:55:30,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:55:30,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:55:30,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:30,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:55:30,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:55:30,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:57:53,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 17:57:53,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:57:54,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:57:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:57:54,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:57:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:57:57,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:57:57,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2018-12-03 17:57:57,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:57:57,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:57:57,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:57:57,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1765, Invalid=5041, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 17:57:57,518 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-12-03 17:57:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:57:58,625 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-03 17:57:58,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:57:58,626 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-12-03 17:57:58,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:57:58,627 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:57:58,627 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:57:58,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1765, Invalid=5041, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 17:57:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:57:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:57:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:57:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 17:57:58,634 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-12-03 17:57:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:57:58,634 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 17:57:58,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:57:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 17:57:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:57:58,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:57:58,636 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 17:57:58,636 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:57:58,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:57:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 21 times [2018-12-03 17:57:58,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:57:58,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:58,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:57:58,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:57:58,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:57:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:57:59,979 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:57:59,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:57:59,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:57:59,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:57:59,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:57:59,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:57:59,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:57:59,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:57:59,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:58:00,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:58:00,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:58:00,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:58:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:58:00,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:58:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:58:03,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:58:03,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 86 [2018-12-03 17:58:03,438 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:58:03,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:58:03,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:58:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 17:58:03,441 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-12-03 17:58:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:04,816 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-03 17:58:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:58:04,821 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-03 17:58:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:04,822 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:58:04,822 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:58:04,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1937, Invalid=5545, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 17:58:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:58:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 17:58:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:58:04,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 17:58:04,829 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-12-03 17:58:04,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:04,829 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 17:58:04,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:58:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 17:58:04,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:58:04,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:04,830 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 17:58:04,831 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:04,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:04,831 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 22 times [2018-12-03 17:58:04,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:04,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:58:04,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:04,832 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:06,127 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:58:06,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:06,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:58:06,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:58:06,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:58:06,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:06,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:58:06,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:06,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:58:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:06,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:58:06,253 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:58:06,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:58:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:58:10,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:58:10,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 90 [2018-12-03 17:58:10,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:58:10,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:58:10,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:58:10,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 17:58:10,289 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-12-03 17:58:11,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:58:11,602 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 17:58:11,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:58:11,603 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-12-03 17:58:11,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:58:11,604 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:58:11,604 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:58:11,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2117, Invalid=6073, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 17:58:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:58:11,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 17:58:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:58:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 17:58:11,611 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-12-03 17:58:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:58:11,611 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 17:58:11,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:58:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 17:58:11,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:58:11,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:58:11,612 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 17:58:11,612 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:58:11,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:58:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 23 times [2018-12-03 17:58:11,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:58:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:11,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:58:11,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:58:11,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:58:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:58:12,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:58:12,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:12,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:58:12,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:58:12,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:58:12,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:58:12,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:58:12,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:58:12,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:00:33,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 18:00:33,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:00:33,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:00:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:33,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:00:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:38,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:00:38,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2018-12-03 18:00:38,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:00:38,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:00:38,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:00:38,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 18:00:38,086 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-12-03 18:00:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:39,534 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-12-03 18:00:39,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:00:39,534 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-12-03 18:00:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:39,535 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:00:39,536 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:00:39,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2305, Invalid=6625, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 18:00:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:00:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 18:00:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:00:39,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 18:00:39,543 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-12-03 18:00:39,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:39,543 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 18:00:39,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:00:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 18:00:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:00:39,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:39,544 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 18:00:39,545 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:39,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 24 times [2018-12-03 18:00:39,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:39,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:00:39,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:39,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:42,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:42,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:42,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:00:42,675 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:00:42,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:00:42,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:42,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:00:42,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:00:42,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:00:42,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:00:42,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:00:42,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:00:42,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:42,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:00:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:47,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:00:47,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 98 [2018-12-03 18:00:47,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:00:47,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:00:47,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:00:47,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2501, Invalid=7201, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 18:00:47,350 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-12-03 18:00:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:48,942 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-03 18:00:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:00:48,942 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-12-03 18:00:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:48,943 INFO L225 Difference]: With dead ends: 55 [2018-12-03 18:00:48,943 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:00:48,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=2501, Invalid=7201, Unknown=0, NotChecked=0, Total=9702 [2018-12-03 18:00:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:00:48,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:00:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:00:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 18:00:48,951 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-12-03 18:00:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:48,952 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 18:00:48,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:00:48,952 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 18:00:48,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:00:48,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:48,952 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 18:00:48,953 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:48,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:48,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 25 times [2018-12-03 18:00:48,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:48,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:00:48,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:48,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:50,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:50,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:00:50,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:00:50,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:00:50,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:50,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:00:50,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:50,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:00:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:50,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:00:50,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:50,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:00:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:55,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:00:55,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 102 [2018-12-03 18:00:55,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:00:55,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:00:55,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:00:55,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2705, Invalid=7801, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:00:55,457 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-12-03 18:00:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:00:57,182 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 18:00:57,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:00:57,182 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-12-03 18:00:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:00:57,183 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:00:57,183 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 18:00:57,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2705, Invalid=7801, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 18:00:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 18:00:57,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 18:00:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 18:00:57,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 18:00:57,190 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-12-03 18:00:57,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:00:57,191 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 18:00:57,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:00:57,191 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 18:00:57,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 18:00:57,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:00:57,192 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 18:00:57,192 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:00:57,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:00:57,192 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 26 times [2018-12-03 18:00:57,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:00:57,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:57,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:00:57,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:00:57,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:00:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:00:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:00:58,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:58,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:00:58,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:00:58,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:00:58,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:00:58,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:00:58,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:00:58,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:03:50,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 18:03:50,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:03:50,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:50,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:50,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:03:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:55,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:03:55,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 106 [2018-12-03 18:03:55,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:03:55,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 18:03:55,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 18:03:55,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2917, Invalid=8425, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 18:03:55,503 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-12-03 18:03:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:03:57,334 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-03 18:03:57,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:03:57,335 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-12-03 18:03:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:03:57,336 INFO L225 Difference]: With dead ends: 59 [2018-12-03 18:03:57,336 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 18:03:57,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2917, Invalid=8425, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 18:03:57,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 18:03:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 18:03:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 18:03:57,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 18:03:57,343 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-12-03 18:03:57,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:03:57,344 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 18:03:57,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 18:03:57,344 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 18:03:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 18:03:57,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:03:57,345 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 18:03:57,345 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:03:57,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:03:57,345 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 27 times [2018-12-03 18:03:57,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:03:57,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:57,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:03:57,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:03:57,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:03:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:03:59,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:59,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:59,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:03:59,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:03:59,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:03:59,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:03:59,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:03:59,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:03:59,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:03:59,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:03:59,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:03:59,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:03:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:03:59,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:04:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:05,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:04:05,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 110 [2018-12-03 18:04:05,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:04:05,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 18:04:05,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 18:04:05,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3137, Invalid=9073, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 18:04:05,882 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-12-03 18:04:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:04:07,985 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-12-03 18:04:07,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 18:04:07,989 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-12-03 18:04:07,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:04:07,990 INFO L225 Difference]: With dead ends: 61 [2018-12-03 18:04:07,990 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 18:04:07,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3137, Invalid=9073, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 18:04:07,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 18:04:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 18:04:07,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 18:04:07,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 18:04:07,995 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-12-03 18:04:07,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:04:07,995 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 18:04:07,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 18:04:07,995 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 18:04:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 18:04:07,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:04:07,996 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 18:04:07,996 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:04:07,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:04:07,996 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 28 times [2018-12-03 18:04:07,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:04:07,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:07,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:04:07,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:07,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:04:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:04:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:10,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:10,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:04:10,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:04:10,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:04:10,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:10,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:04:10,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:04:10,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:04:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:04:10,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:04:10,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:10,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:04:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:16,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:04:16,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 114 [2018-12-03 18:04:16,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:04:16,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 18:04:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 18:04:16,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3365, Invalid=9745, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 18:04:16,861 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-12-03 18:04:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:04:19,042 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 18:04:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:04:19,042 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-12-03 18:04:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:04:19,043 INFO L225 Difference]: With dead ends: 63 [2018-12-03 18:04:19,043 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 18:04:19,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3365, Invalid=9745, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 18:04:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 18:04:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 18:04:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 18:04:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 18:04:19,050 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-12-03 18:04:19,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:04:19,050 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 18:04:19,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 18:04:19,050 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 18:04:19,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 18:04:19,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:04:19,051 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 18:04:19,051 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:04:19,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:04:19,051 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 29 times [2018-12-03 18:04:19,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:04:19,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:19,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:04:19,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:04:19,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:04:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:04:20,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:04:20,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:20,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:04:20,853 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:04:20,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:04:20,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:04:20,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:04:20,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:04:20,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)