java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:52:58,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:52:58,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:52:58,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:52:58,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:52:58,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:52:58,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:52:58,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:52:58,744 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:52:58,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:52:58,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:52:58,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:52:58,754 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:52:58,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:52:58,760 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:52:58,761 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:52:58,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:52:58,764 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:52:58,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:52:58,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:52:58,776 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:52:58,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:52:58,780 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:52:58,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:52:58,782 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:52:58,783 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:52:58,783 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:52:58,785 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:52:58,787 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:52:58,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:52:58,788 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:52:58,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:52:58,791 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:52:58,791 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:52:58,792 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:52:58,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:52:58,793 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-18 17:52:58,817 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:52:58,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:52:58,818 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:52:58,818 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:52:58,819 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:52:58,819 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:52:58,819 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:52:58,819 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:52:58,819 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:52:58,820 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 17:52:58,820 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 17:52:58,820 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:52:58,820 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:52:58,821 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:52:58,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:52:58,822 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:52:58,822 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:52:58,822 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:52:58,823 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:52:58,823 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:52:58,823 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:52:58,823 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:52:58,823 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:52:58,824 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:52:58,825 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:52:58,825 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:52:58,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:52:58,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:52:58,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:52:58,826 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:52:58,826 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:52:58,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:52:58,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:52:58,827 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:52:58,827 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:52:58,827 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:52:58,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:52:58,828 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:52:58,828 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:52:58,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:52:58,880 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:52:58,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:52:58,885 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:52:58,885 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:52:58,886 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-01-18 17:52:58,887 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-18 17:52:58,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:52:58,927 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:52:58,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:52:58,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:52:58,928 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:52:58,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:52:58,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:52:58,964 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:52:58,964 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:52:58,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,977 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:52:58,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:52:58,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:52:58,986 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:52:58,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:52:59,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:52:59,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:52:59,301 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:52:59,302 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-18 17:52:59,303 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:52:59 BoogieIcfgContainer [2019-01-18 17:52:59,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:52:59,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:52:59,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:52:59,307 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:52:59,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/2) ... [2019-01-18 17:52:59,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60412bf4 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:52:59, skipping insertion in model container [2019-01-18 17:52:59,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:52:59" (2/2) ... [2019-01-18 17:52:59,311 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-18 17:52:59,321 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:52:59,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:52:59,345 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:52:59,379 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:52:59,379 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:52:59,379 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:52:59,379 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:52:59,379 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:52:59,380 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:52:59,380 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:52:59,380 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:52:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-18 17:52:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:52:59,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:52:59,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:52:59,405 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:52:59,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:52:59,412 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-18 17:52:59,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:52:59,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:52:59,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:52:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:52:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:52:59,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:52:59,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:52:59,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:52:59,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:52:59,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:52:59,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:52:59,553 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-18 17:52:59,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:52:59,647 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 17:52:59,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:52:59,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-18 17:52:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:52:59,662 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:52:59,663 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 17:52:59,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:52:59,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 17:52:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-18 17:52:59,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 17:52:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-18 17:52:59,716 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-18 17:52:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:52:59,716 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-18 17:52:59,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:52:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-18 17:52:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:52:59,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:52:59,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:52:59,717 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:52:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:52:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-18 17:52:59,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:52:59,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:52:59,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:52:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:52:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:52:59,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:52:59,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:52:59,857 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:52:59,860 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-18 17:52:59,937 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 17:52:59,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:53:02,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:53:02,508 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 17:53:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:02,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:53:02,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:02,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:02,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:02,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:02,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:53:02,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 17:53:02,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:02,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-18 17:53:02,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:02,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:53:02,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:53:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:53:02,940 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-18 17:53:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:02,987 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-18 17:53:02,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:53:02,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-18 17:53:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:02,988 INFO L225 Difference]: With dead ends: 13 [2019-01-18 17:53:02,988 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 17:53:02,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:53:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 17:53:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-18 17:53:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 17:53:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-18 17:53:02,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-18 17:53:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:02,993 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-18 17:53:02,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:53:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-18 17:53:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:53:02,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:02,994 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-18 17:53:02,994 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-18 17:53:02,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:02,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:02,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:53:03,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:03,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:03,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:03,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:03,143 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:03,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:03,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:53:03,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:03,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:53:03,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:53:03,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:03,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-18 17:53:03,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:03,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:53:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:53:03,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:53:03,443 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-18 17:53:03,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:03,606 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-18 17:53:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:53:03,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-18 17:53:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:03,607 INFO L225 Difference]: With dead ends: 16 [2019-01-18 17:53:03,607 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:53:03,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:53:03,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:53:03,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 17:53:03,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:53:03,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-18 17:53:03,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-18 17:53:03,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:03,611 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-18 17:53:03,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:53:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-18 17:53:03,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:53:03,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:03,612 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-18 17:53:03,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:03,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:03,613 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-18 17:53:03,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-18 17:53:03,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:03,720 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:03,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:03,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:03,739 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:03,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:03,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:03,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:03,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-18 17:53:03,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-18 17:53:03,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:03,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-18 17:53:03,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:03,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:53:03,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:53:03,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:53:03,973 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-18 17:53:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:04,040 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-18 17:53:04,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:53:04,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-18 17:53:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:04,042 INFO L225 Difference]: With dead ends: 19 [2019-01-18 17:53:04,042 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:53:04,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:53:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:53:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-18 17:53:04,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:53:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-18 17:53:04,046 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-18 17:53:04,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:04,047 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-18 17:53:04,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:53:04,047 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-18 17:53:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-18 17:53:04,048 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:04,048 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-18 17:53:04,048 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-18 17:53:04,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:04,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:04,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-18 17:53:04,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:04,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:04,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:04,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:04,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:04,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:04,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-18 17:53:04,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-18 17:53:04,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:04,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-18 17:53:04,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:04,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:53:04,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:53:04,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:53:04,601 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-18 17:53:04,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:04,855 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-18 17:53:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:53:04,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-18 17:53:04,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:04,857 INFO L225 Difference]: With dead ends: 22 [2019-01-18 17:53:04,857 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 17:53:04,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:53:04,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 17:53:04,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-18 17:53:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 17:53:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-18 17:53:04,861 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-18 17:53:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:04,861 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-18 17:53:04,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:53:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-18 17:53:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-18 17:53:04,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:04,862 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-18 17:53:04,863 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:04,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:04,863 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-18 17:53:04,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:04,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:04,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-18 17:53:05,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:05,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:05,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:05,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:05,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:05,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:05,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:53:05,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:05,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-18 17:53:05,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-18 17:53:05,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:05,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-18 17:53:05,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:05,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:53:05,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:53:05,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:53:05,569 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-18 17:53:05,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:05,671 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-18 17:53:05,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:53:05,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-18 17:53:05,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:05,672 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:53:05,672 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:53:05,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:53:05,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:53:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 17:53:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:53:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-18 17:53:05,676 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-18 17:53:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:05,676 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-18 17:53:05,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:53:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-18 17:53:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-18 17:53:05,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:05,677 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-18 17:53:05,678 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-18 17:53:05,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:05,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:05,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 17:53:05,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:05,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:05,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:05,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:05,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:05,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:05,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:05,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:05,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 17:53:05,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 17:53:06,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:06,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-18 17:53:06,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:06,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:53:06,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:53:06,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:53:06,092 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-18 17:53:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:06,167 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-18 17:53:06,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:53:06,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-18 17:53:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:06,168 INFO L225 Difference]: With dead ends: 28 [2019-01-18 17:53:06,168 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:53:06,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:53:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:53:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-18 17:53:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-18 17:53:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-18 17:53:06,173 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-18 17:53:06,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:06,173 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-18 17:53:06,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:53:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-18 17:53:06,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-18 17:53:06,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:06,174 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-18 17:53:06,174 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:06,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:06,175 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-18 17:53:06,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:06,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:06,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-18 17:53:06,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:06,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:06,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:06,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:06,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:06,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:06,338 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-18 17:53:06,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-18 17:53:06,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:06,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-18 17:53:06,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:06,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:53:06,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:53:06,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:53:06,615 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-18 17:53:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:06,726 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-18 17:53:06,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:53:06,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-18 17:53:06,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:06,728 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:53:06,729 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:53:06,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:53:06,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:53:06,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-18 17:53:06,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:53:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-18 17:53:06,733 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-18 17:53:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:06,733 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-18 17:53:06,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:53:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-18 17:53:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-18 17:53:06,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:06,734 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-18 17:53:06,735 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:06,735 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-18 17:53:06,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:06,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:06,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-18 17:53:06,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:06,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:06,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:06,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:06,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:06,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-18 17:53:06,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:06,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-18 17:53:06,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:07,157 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-18 17:53:07,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:07,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-18 17:53:07,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:07,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:53:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:53:07,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:53:07,178 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-18 17:53:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:07,403 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-18 17:53:07,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:53:07,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-18 17:53:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:07,404 INFO L225 Difference]: With dead ends: 34 [2019-01-18 17:53:07,404 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:53:07,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:53:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:53:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-18 17:53:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:53:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-18 17:53:07,412 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-18 17:53:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:07,413 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-18 17:53:07,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:53:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-18 17:53:07,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-18 17:53:07,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:07,414 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-18 17:53:07,414 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:07,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-18 17:53:07,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:07,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:07,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:07,593 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-18 17:53:07,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:07,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:07,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:07,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:07,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:07,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:07,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:07,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:07,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:07,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:07,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-18 17:53:07,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:07,847 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-18 17:53:07,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:07,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-18 17:53:07,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:07,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:53:07,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:53:07,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:53:07,867 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-18 17:53:07,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:07,932 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-18 17:53:07,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:53:07,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-18 17:53:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:07,933 INFO L225 Difference]: With dead ends: 37 [2019-01-18 17:53:07,933 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:53:07,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:53:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:53:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-18 17:53:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-18 17:53:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-18 17:53:07,939 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-18 17:53:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:07,939 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-18 17:53:07,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:53:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-18 17:53:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-18 17:53:07,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:07,940 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-18 17:53:07,946 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:07,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-18 17:53:07,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:07,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:07,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-18 17:53:08,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:08,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:08,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:08,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:08,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:08,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-18 17:53:08,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-18 17:53:08,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:08,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-18 17:53:08,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:08,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:53:08,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:53:08,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:53:08,527 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-18 17:53:08,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:08,586 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-18 17:53:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:53:08,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-18 17:53:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:08,588 INFO L225 Difference]: With dead ends: 40 [2019-01-18 17:53:08,588 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:53:08,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:53:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:53:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-18 17:53:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 17:53:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-18 17:53:08,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-18 17:53:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:08,594 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-18 17:53:08,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:53:08,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-18 17:53:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-18 17:53:08,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:08,595 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-18 17:53:08,595 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:08,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-18 17:53:08,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:08,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:08,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-18 17:53:08,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:08,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:08,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:08,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:08,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:08,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:08,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-18 17:53:08,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:08,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-18 17:53:08,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-18 17:53:09,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:09,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-18 17:53:09,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:09,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:53:09,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:53:09,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:53:09,259 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-18 17:53:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:09,310 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-18 17:53:09,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:53:09,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-18 17:53:09,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:09,312 INFO L225 Difference]: With dead ends: 43 [2019-01-18 17:53:09,312 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:53:09,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:53:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:53:09,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-18 17:53:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-18 17:53:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-18 17:53:09,317 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-18 17:53:09,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:09,318 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-18 17:53:09,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:53:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-18 17:53:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-18 17:53:09,319 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:09,319 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-18 17:53:09,319 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-18 17:53:09,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:09,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:09,461 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-18 17:53:09,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:09,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:09,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:09,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:09,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:09,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:09,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:09,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:09,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:09,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:09,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-18 17:53:09,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-18 17:53:09,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:09,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-18 17:53:09,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:09,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-18 17:53:09,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-18 17:53:09,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:53:09,808 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-18 17:53:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:09,903 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-18 17:53:09,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:53:09,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-18 17:53:09,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:09,904 INFO L225 Difference]: With dead ends: 46 [2019-01-18 17:53:09,904 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:53:09,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:53:09,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:53:09,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-18 17:53:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:53:09,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-18 17:53:09,909 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-18 17:53:09,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:09,910 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-18 17:53:09,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-18 17:53:09,910 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-18 17:53:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-18 17:53:09,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:09,911 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-18 17:53:09,911 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:09,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:09,911 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-18 17:53:09,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:09,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:09,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-18 17:53:10,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:10,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:10,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:10,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:10,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:10,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:10,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:10,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:10,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-18 17:53:10,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:10,462 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-18 17:53:10,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:10,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-18 17:53:10,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:10,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 17:53:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 17:53:10,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:53:10,483 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-18 17:53:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:10,550 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-18 17:53:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:53:10,550 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-18 17:53:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:10,551 INFO L225 Difference]: With dead ends: 49 [2019-01-18 17:53:10,551 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:53:10,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:53:10,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:53:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-18 17:53:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:53:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-18 17:53:10,564 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-18 17:53:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:10,564 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-18 17:53:10,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 17:53:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-18 17:53:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-18 17:53:10,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:10,566 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-18 17:53:10,566 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:10,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-18 17:53:10,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:10,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:10,857 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-18 17:53:10,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:10,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:10,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:10,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:10,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:10,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:10,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:10,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:10,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-18 17:53:10,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:10,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:10,919 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-18 17:53:10,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-18 17:53:11,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:11,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-18 17:53:11,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:11,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:53:11,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:53:11,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:53:11,352 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-18 17:53:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:11,421 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-18 17:53:11,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:53:11,422 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-18 17:53:11,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:11,423 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:53:11,423 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:53:11,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:53:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:53:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-18 17:53:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 17:53:11,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-18 17:53:11,428 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-18 17:53:11,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:11,429 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-18 17:53:11,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:53:11,429 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-18 17:53:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-18 17:53:11,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:11,430 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-18 17:53:11,430 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-18 17:53:11,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:11,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:11,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:11,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:11,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-18 17:53:11,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:11,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:11,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:11,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:11,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:11,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:11,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:11,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:11,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:11,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:11,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:11,697 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-18 17:53:11,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-18 17:53:12,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:12,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-18 17:53:12,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:12,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-18 17:53:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-18 17:53:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:53:12,127 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-18 17:53:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:12,191 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-18 17:53:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:53:12,191 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-18 17:53:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:12,192 INFO L225 Difference]: With dead ends: 55 [2019-01-18 17:53:12,192 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:53:12,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:53:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:53:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-18 17:53:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:53:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-18 17:53:12,197 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-18 17:53:12,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:12,197 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-18 17:53:12,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-18 17:53:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-18 17:53:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-18 17:53:12,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:12,198 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-18 17:53:12,199 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:12,199 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-18 17:53:12,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:12,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:12,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-18 17:53:12,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:12,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:12,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:12,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:12,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:12,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:12,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:12,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:12,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:13,004 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-18 17:53:13,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-18 17:53:13,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:13,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-18 17:53:13,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:13,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-18 17:53:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-18 17:53:13,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:53:13,726 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-18 17:53:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:13,794 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-18 17:53:13,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:53:13,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-18 17:53:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:13,796 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:53:13,796 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:53:13,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:53:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:53:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-18 17:53:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:53:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-18 17:53:13,803 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-18 17:53:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:13,803 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-18 17:53:13,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-18 17:53:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-18 17:53:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-18 17:53:13,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:13,805 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-18 17:53:13,806 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:13,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:13,806 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-18 17:53:13,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:13,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:13,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:13,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:13,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-18 17:53:14,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:14,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:14,031 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:14,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:14,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:14,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:14,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:14,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:14,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-18 17:53:14,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:14,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-18 17:53:14,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-18 17:53:14,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:14,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-18 17:53:14,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:14,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-18 17:53:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-18 17:53:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:53:14,694 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-18 17:53:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:14,775 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-18 17:53:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:53:14,775 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-18 17:53:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:14,776 INFO L225 Difference]: With dead ends: 61 [2019-01-18 17:53:14,776 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:53:14,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:53:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:53:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-18 17:53:14,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:53:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-18 17:53:14,782 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-18 17:53:14,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:14,783 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-18 17:53:14,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-18 17:53:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-18 17:53:14,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-18 17:53:14,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:14,784 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-18 17:53:14,784 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:14,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:14,784 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-18 17:53:14,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:14,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:14,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:14,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:14,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-18 17:53:15,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:15,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:15,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:15,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:15,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:15,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:15,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:15,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:15,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:15,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:15,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-18 17:53:15,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-18 17:53:16,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:16,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-18 17:53:16,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:16,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-18 17:53:16,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-18 17:53:16,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:53:16,198 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-18 17:53:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:16,369 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-18 17:53:16,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:53:16,369 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-18 17:53:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:16,370 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:53:16,370 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:53:16,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:53:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:53:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-18 17:53:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-18 17:53:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-18 17:53:16,374 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-18 17:53:16,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:16,375 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-18 17:53:16,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-18 17:53:16,375 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-18 17:53:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-18 17:53:16,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:16,376 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-18 17:53:16,376 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:16,376 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-18 17:53:16,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:16,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:16,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:16,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:16,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-18 17:53:17,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:17,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:17,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:17,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:17,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:17,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:17,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:17,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:17,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-18 17:53:17,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:17,691 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-18 17:53:17,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:17,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-18 17:53:17,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:17,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-18 17:53:17,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-18 17:53:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:53:17,711 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-18 17:53:17,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:17,779 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-18 17:53:17,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:53:17,780 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-18 17:53:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:17,781 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:53:17,781 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:53:17,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:53:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:53:17,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-18 17:53:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:53:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-18 17:53:17,787 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-18 17:53:17,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:17,787 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-18 17:53:17,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-18 17:53:17,788 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-18 17:53:17,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-18 17:53:17,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:17,788 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-18 17:53:17,789 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:17,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:17,789 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-18 17:53:17,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:17,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:17,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:17,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:17,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:18,143 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-18 17:53:18,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:18,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:18,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:18,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:18,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:18,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:18,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:18,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:18,214 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-18 17:53:18,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:18,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-18 17:53:18,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-18 17:53:18,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:18,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-18 17:53:18,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:18,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:53:18,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:53:18,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:53:18,738 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-18 17:53:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:18,810 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-18 17:53:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:53:18,811 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-18 17:53:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:18,812 INFO L225 Difference]: With dead ends: 70 [2019-01-18 17:53:18,812 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:53:18,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:53:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:53:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-18 17:53:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:53:18,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-18 17:53:18,818 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-18 17:53:18,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:18,818 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-18 17:53:18,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:53:18,819 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-18 17:53:18,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-18 17:53:18,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:18,820 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-18 17:53:18,820 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:18,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:18,820 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-18 17:53:18,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:18,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:18,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:18,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:18,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-18 17:53:19,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:19,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:19,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:19,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:19,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:19,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:19,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:19,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:19,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:19,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:19,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-18 17:53:19,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:19,843 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-18 17:53:19,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-18 17:53:19,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:19,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-18 17:53:19,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-18 17:53:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:53:19,864 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-18 17:53:19,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:19,995 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-18 17:53:19,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:53:19,999 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-18 17:53:19,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:20,000 INFO L225 Difference]: With dead ends: 73 [2019-01-18 17:53:20,000 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:53:20,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:53:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:53:20,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-18 17:53:20,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-18 17:53:20,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-18 17:53:20,006 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-18 17:53:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:20,006 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-18 17:53:20,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-18 17:53:20,007 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-18 17:53:20,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-18 17:53:20,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:20,007 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-18 17:53:20,008 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:20,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:20,008 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-18 17:53:20,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:20,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:20,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:20,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:20,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-18 17:53:20,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:20,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:20,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:20,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:20,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:20,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:20,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:20,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:20,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-18 17:53:20,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-18 17:53:21,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:21,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-18 17:53:21,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:21,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-18 17:53:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-18 17:53:21,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:53:21,545 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-18 17:53:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:21,663 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-18 17:53:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:53:21,666 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-18 17:53:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:21,667 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:53:21,667 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:53:21,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:53:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:53:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-18 17:53:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:53:21,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-18 17:53:21,671 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-18 17:53:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:21,672 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-18 17:53:21,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-18 17:53:21,672 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-18 17:53:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-18 17:53:21,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:21,673 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-18 17:53:21,673 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:21,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:21,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-18 17:53:21,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:21,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:21,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:21,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-18 17:53:22,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:22,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:22,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:22,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:22,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:22,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:22,200 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:22,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:22,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-18 17:53:22,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:22,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-18 17:53:22,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:22,911 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-18 17:53:22,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:22,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-18 17:53:22,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:22,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:53:22,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:53:22,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:53:22,935 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-18 17:53:23,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:23,028 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-18 17:53:23,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:53:23,029 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-18 17:53:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:23,029 INFO L225 Difference]: With dead ends: 79 [2019-01-18 17:53:23,029 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:53:23,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:53:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:53:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-18 17:53:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-18 17:53:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-18 17:53:23,034 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-18 17:53:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:23,034 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-18 17:53:23,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:53:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-18 17:53:23,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-18 17:53:23,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:23,035 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-18 17:53:23,035 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:23,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-18 17:53:23,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:23,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:23,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:23,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:23,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-18 17:53:23,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:23,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:23,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:23,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:23,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:23,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:23,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:23,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:23,407 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:23,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:23,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-18 17:53:23,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-18 17:53:24,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:24,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-18 17:53:24,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:24,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:53:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:53:24,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:53:24,627 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-18 17:53:24,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:24,729 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-18 17:53:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:53:24,733 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-18 17:53:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:24,733 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:53:24,733 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:53:24,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:53:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:53:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-18 17:53:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 17:53:24,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-18 17:53:24,737 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-18 17:53:24,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:24,738 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-18 17:53:24,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:53:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-18 17:53:24,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-18 17:53:24,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:24,739 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-18 17:53:24,739 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:24,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:24,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-18 17:53:24,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:24,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:24,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-18 17:53:25,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:25,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:25,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:25,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:25,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:25,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:25,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:25,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:25,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:25,835 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-18 17:53:25,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-18 17:53:26,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-18 17:53:26,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:26,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-18 17:53:26,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-18 17:53:26,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:53:26,922 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-18 17:53:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:27,056 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-18 17:53:27,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:53:27,056 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-18 17:53:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:27,057 INFO L225 Difference]: With dead ends: 85 [2019-01-18 17:53:27,057 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:53:27,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:53:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:53:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-18 17:53:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-18 17:53:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-18 17:53:27,064 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-18 17:53:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:27,064 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-18 17:53:27,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-18 17:53:27,064 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-18 17:53:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-18 17:53:27,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:27,065 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-18 17:53:27,066 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:27,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-18 17:53:27,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:27,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:27,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:27,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:27,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-18 17:53:27,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:27,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:27,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:27,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:27,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:27,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:27,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:27,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:27,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-18 17:53:27,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:27,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-18 17:53:27,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-18 17:53:28,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:28,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-18 17:53:28,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:28,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:53:28,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:53:28,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:53:28,594 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-18 17:53:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:28,708 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-18 17:53:28,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:53:28,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-18 17:53:28,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:28,709 INFO L225 Difference]: With dead ends: 88 [2019-01-18 17:53:28,709 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:53:28,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:53:28,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:53:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-18 17:53:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 17:53:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-18 17:53:28,713 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-18 17:53:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:28,714 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-18 17:53:28,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:53:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-18 17:53:28,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-18 17:53:28,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:28,715 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-18 17:53:28,715 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-18 17:53:28,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:28,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:28,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:28,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:29,325 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-18 17:53:29,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:29,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:29,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:29,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:29,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:29,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:29,337 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:29,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:29,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:29,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:29,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-18 17:53:29,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-18 17:53:30,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:30,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-18 17:53:30,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:30,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-18 17:53:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-18 17:53:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:53:30,257 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-18 17:53:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:30,376 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-18 17:53:30,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:53:30,377 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-18 17:53:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:30,378 INFO L225 Difference]: With dead ends: 91 [2019-01-18 17:53:30,378 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:53:30,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:53:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:53:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-18 17:53:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:53:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-18 17:53:30,382 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-18 17:53:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:30,382 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-18 17:53:30,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-18 17:53:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-18 17:53:30,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-18 17:53:30,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:30,383 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-18 17:53:30,384 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:30,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:30,384 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-18 17:53:30,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:30,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:30,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-18 17:53:30,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:30,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:30,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:30,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:30,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:30,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:30,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:30,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:30,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:30,876 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-18 17:53:30,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-18 17:53:32,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:32,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-18 17:53:32,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:32,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-18 17:53:32,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-18 17:53:32,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:53:32,142 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-18 17:53:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:32,271 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-18 17:53:32,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:53:32,272 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-18 17:53:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:32,272 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:53:32,273 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:53:32,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:53:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:53:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-18 17:53:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-18 17:53:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-18 17:53:32,276 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-18 17:53:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:32,277 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-18 17:53:32,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-18 17:53:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-18 17:53:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-18 17:53:32,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:32,277 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-18 17:53:32,278 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:32,278 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-18 17:53:32,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:32,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:32,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:32,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-18 17:53:32,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:32,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:32,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:32,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:32,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:32,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:32,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:32,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:32,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-18 17:53:32,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:32,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-18 17:53:32,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-18 17:53:34,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:34,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-18 17:53:34,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:34,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:53:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:53:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:53:34,025 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-18 17:53:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:34,133 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-18 17:53:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:53:34,133 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-18 17:53:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:34,134 INFO L225 Difference]: With dead ends: 97 [2019-01-18 17:53:34,134 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:53:34,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:53:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:53:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-18 17:53:34,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-18 17:53:34,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-18 17:53:34,138 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-18 17:53:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:34,139 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-18 17:53:34,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:53:34,139 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-18 17:53:34,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-18 17:53:34,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:34,139 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-18 17:53:34,140 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:34,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:34,140 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-18 17:53:34,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:34,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:34,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-18 17:53:35,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:35,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:35,159 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:35,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:35,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:35,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:35,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:35,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:35,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:35,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:35,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-18 17:53:35,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-18 17:53:36,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:36,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-18 17:53:36,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:36,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-18 17:53:36,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-18 17:53:36,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:53:36,406 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-18 17:53:36,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:36,694 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-18 17:53:36,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:53:36,695 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-18 17:53:36,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:36,696 INFO L225 Difference]: With dead ends: 100 [2019-01-18 17:53:36,696 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:53:36,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:53:36,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:53:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-18 17:53:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-18 17:53:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-18 17:53:36,700 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-18 17:53:36,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:36,701 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-18 17:53:36,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-18 17:53:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-18 17:53:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-18 17:53:36,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:36,701 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-18 17:53:36,702 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-18 17:53:36,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:36,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:36,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:36,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:36,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-18 17:53:37,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:37,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:37,219 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:37,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:37,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:37,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:37,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:37,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:37,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-18 17:53:37,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-18 17:53:38,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:38,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-18 17:53:38,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:38,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-18 17:53:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-18 17:53:38,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:53:38,414 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-18 17:53:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:38,534 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-18 17:53:38,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:53:38,535 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-18 17:53:38,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:38,536 INFO L225 Difference]: With dead ends: 103 [2019-01-18 17:53:38,536 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:53:38,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:53:38,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:53:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-18 17:53:38,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-18 17:53:38,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-18 17:53:38,541 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-18 17:53:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:38,541 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-18 17:53:38,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-18 17:53:38,541 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-18 17:53:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-18 17:53:38,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:38,542 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-18 17:53:38,542 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:38,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:38,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-18 17:53:38,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:38,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:38,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:38,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:38,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:38,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-18 17:53:39,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:39,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:39,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:39,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:39,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:39,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:39,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:39,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:39,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-18 17:53:39,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:39,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-18 17:53:39,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:40,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-18 17:53:40,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:40,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-18 17:53:40,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:40,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:53:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:53:40,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:53:40,531 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-18 17:53:40,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:40,679 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-18 17:53:40,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:53:40,679 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-18 17:53:40,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:40,680 INFO L225 Difference]: With dead ends: 106 [2019-01-18 17:53:40,680 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:53:40,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:53:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:53:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-18 17:53:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:53:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-18 17:53:40,685 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-18 17:53:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:40,685 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-18 17:53:40,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:53:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-18 17:53:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-18 17:53:40,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:40,686 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-18 17:53:40,686 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-18 17:53:40,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:40,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:40,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:40,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:40,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-18 17:53:41,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:41,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:41,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:41,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:41,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:41,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:41,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:41,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:41,289 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:41,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:41,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:41,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-18 17:53:41,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:42,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-18 17:53:42,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:42,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-18 17:53:42,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:42,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-18 17:53:42,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-18 17:53:42,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:53:42,625 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-18 17:53:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:42,805 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-18 17:53:42,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:53:42,806 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-18 17:53:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:42,806 INFO L225 Difference]: With dead ends: 109 [2019-01-18 17:53:42,807 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:53:42,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:53:42,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:53:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-18 17:53:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:53:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-18 17:53:42,809 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-18 17:53:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:42,809 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-18 17:53:42,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-18 17:53:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-18 17:53:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-18 17:53:42,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:42,810 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-18 17:53:42,810 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:42,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:42,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-18 17:53:42,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:42,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:42,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:42,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-18 17:53:43,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:43,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:43,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:43,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:43,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:43,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:43,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:43,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:43,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-18 17:53:43,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-18 17:53:44,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:44,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-18 17:53:44,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:44,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-18 17:53:44,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-18 17:53:44,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:53:44,735 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-18 17:53:44,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:44,910 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-18 17:53:44,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:53:44,910 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-18 17:53:44,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:44,911 INFO L225 Difference]: With dead ends: 112 [2019-01-18 17:53:44,911 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:53:44,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:53:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:53:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-18 17:53:44,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:53:44,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-18 17:53:44,915 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-18 17:53:44,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:44,915 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-18 17:53:44,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-18 17:53:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-18 17:53:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-18 17:53:44,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:44,916 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-18 17:53:44,916 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:44,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-18 17:53:44,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:44,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:44,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:44,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:44,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-18 17:53:45,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:45,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:45,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:45,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:45,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:45,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:45,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:45,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:46,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-18 17:53:46,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:46,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-18 17:53:46,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:47,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-18 17:53:47,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:47,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-18 17:53:47,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:47,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:53:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:53:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:53:47,775 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-18 17:53:47,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:47,910 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-18 17:53:47,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:53:47,911 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-18 17:53:47,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:47,912 INFO L225 Difference]: With dead ends: 115 [2019-01-18 17:53:47,912 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 17:53:47,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:53:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 17:53:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-18 17:53:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:53:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-18 17:53:47,915 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-18 17:53:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:47,916 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-18 17:53:47,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:53:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-18 17:53:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-18 17:53:47,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:47,916 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-18 17:53:47,916 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:47,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:47,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-18 17:53:47,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:47,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:47,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:47,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-18 17:53:48,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:48,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:48,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:48,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:48,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:48,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:48,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:48,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:48,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:48,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:48,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-18 17:53:48,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-18 17:53:50,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:50,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-18 17:53:50,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:50,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-18 17:53:50,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-18 17:53:50,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:53:50,175 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-18 17:53:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:50,324 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-18 17:53:50,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:53:50,324 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-18 17:53:50,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:50,325 INFO L225 Difference]: With dead ends: 118 [2019-01-18 17:53:50,325 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:53:50,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:53:50,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:53:50,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-18 17:53:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-18 17:53:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-18 17:53:50,329 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-18 17:53:50,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:50,330 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-18 17:53:50,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-18 17:53:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-18 17:53:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-18 17:53:50,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:50,331 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-18 17:53:50,331 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-18 17:53:50,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:50,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:50,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:50,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-18 17:53:51,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:51,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:51,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:51,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:51,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:51,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:51,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:51,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:51,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-18 17:53:51,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-18 17:53:52,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-18 17:53:52,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:52,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-18 17:53:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-18 17:53:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:53:52,904 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-18 17:53:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:53,066 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-18 17:53:53,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:53:53,067 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-18 17:53:53,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:53,067 INFO L225 Difference]: With dead ends: 121 [2019-01-18 17:53:53,067 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:53:53,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:53:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:53:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-18 17:53:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-18 17:53:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-18 17:53:53,072 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-18 17:53:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:53,072 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-18 17:53:53,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-18 17:53:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-18 17:53:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-18 17:53:53,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:53,083 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-18 17:53:53,083 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-18 17:53:53,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:53,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:53,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:53,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:53,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-18 17:53:53,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:53,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:53,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:53,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:53,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:53,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:53,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:53,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:54,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-18 17:53:54,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:54,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-18 17:53:54,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-18 17:53:55,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:55,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-18 17:53:55,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:55,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:53:55,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:53:55,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:53:55,838 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-18 17:53:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:55,992 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-18 17:53:55,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:53:55,992 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-18 17:53:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:55,993 INFO L225 Difference]: With dead ends: 124 [2019-01-18 17:53:55,993 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:53:55,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:53:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:53:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-18 17:53:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-18 17:53:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-18 17:53:55,996 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-18 17:53:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:55,996 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-18 17:53:55,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:53:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-18 17:53:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-18 17:53:55,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:55,997 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-18 17:53:55,997 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:55,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-18 17:53:55,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:55,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:55,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-18 17:53:56,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:56,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:56,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:56,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:56,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:56,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:56,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:56,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:56,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:56,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:56,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-18 17:53:56,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-18 17:53:58,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:58,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-18 17:53:58,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:58,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-18 17:53:58,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-18 17:53:58,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:53:58,676 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-18 17:53:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:58,835 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-18 17:53:58,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:53:58,836 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-18 17:53:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:58,836 INFO L225 Difference]: With dead ends: 127 [2019-01-18 17:53:58,836 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:53:58,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:53:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:53:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-18 17:53:58,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-18 17:53:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-18 17:53:58,839 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-18 17:53:58,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:58,840 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-18 17:53:58,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-18 17:53:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-18 17:53:58,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-18 17:53:58,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:58,840 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-18 17:53:58,840 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:58,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:58,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-18 17:53:58,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:58,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:58,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:58,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-18 17:53:59,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:59,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:59,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:59,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:59,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:59,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:59,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:59,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:59,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-18 17:53:59,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-18 17:54:02,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:02,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-18 17:54:02,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:02,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-18 17:54:02,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-18 17:54:02,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:54:02,022 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-18 17:54:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:02,259 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-18 17:54:02,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:54:02,259 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-18 17:54:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:02,260 INFO L225 Difference]: With dead ends: 130 [2019-01-18 17:54:02,260 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 17:54:02,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:54:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 17:54:02,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-18 17:54:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-18 17:54:02,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-18 17:54:02,264 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-18 17:54:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:02,264 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-18 17:54:02,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-18 17:54:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-18 17:54:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-18 17:54:02,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:02,265 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-18 17:54:02,265 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:02,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:02,265 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-18 17:54:02,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:02,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:02,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:02,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:02,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-18 17:54:05,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:05,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:05,032 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:05,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:05,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:05,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:05,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:05,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:05,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-18 17:54:05,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:05,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-18 17:54:05,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-18 17:54:07,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:07,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-18 17:54:07,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:07,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:54:07,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:54:07,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:54:07,478 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-18 17:54:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:07,651 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-18 17:54:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:54:07,651 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-18 17:54:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:07,652 INFO L225 Difference]: With dead ends: 133 [2019-01-18 17:54:07,652 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:54:07,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:54:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:54:07,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-18 17:54:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-18 17:54:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-18 17:54:07,656 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-18 17:54:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:07,657 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-18 17:54:07,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:54:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-18 17:54:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-18 17:54:07,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:07,658 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-18 17:54:07,658 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:07,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-18 17:54:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:07,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:07,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-18 17:54:09,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:09,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:09,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:09,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:09,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:09,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:09,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:09,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:09,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:09,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:09,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-18 17:54:09,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:11,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-18 17:54:11,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:11,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-18 17:54:11,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:11,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-18 17:54:11,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-18 17:54:11,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:54:11,418 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-18 17:54:11,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:11,603 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-18 17:54:11,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:54:11,604 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-18 17:54:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:11,604 INFO L225 Difference]: With dead ends: 136 [2019-01-18 17:54:11,604 INFO L226 Difference]: Without dead ends: 91 [2019-01-18 17:54:11,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:54:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-18 17:54:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-18 17:54:11,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-18 17:54:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-18 17:54:11,609 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-18 17:54:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:11,609 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-18 17:54:11,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-18 17:54:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-18 17:54:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-18 17:54:11,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:11,610 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-18 17:54:11,610 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:11,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:11,610 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-18 17:54:11,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:11,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:11,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:11,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-18 17:54:12,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:12,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:12,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:12,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:12,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:12,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:12,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:12,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:13,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-18 17:54:13,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-18 17:54:15,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:15,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-18 17:54:15,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:15,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-18 17:54:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-18 17:54:15,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:54:15,135 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-18 17:54:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:15,384 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-18 17:54:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 17:54:15,385 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-18 17:54:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:15,386 INFO L225 Difference]: With dead ends: 139 [2019-01-18 17:54:15,386 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:54:15,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:54:15,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:54:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-18 17:54:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 17:54:15,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-18 17:54:15,388 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-18 17:54:15,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:15,389 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-18 17:54:15,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-18 17:54:15,389 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-18 17:54:15,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-18 17:54:15,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:15,389 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-18 17:54:15,390 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-18 17:54:15,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:15,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:15,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:15,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:15,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:16,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-18 17:54:16,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:16,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:16,221 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:16,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:16,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:16,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:16,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:16,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:16,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-18 17:54:16,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:16,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-18 17:54:16,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-18 17:54:19,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:19,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-18 17:54:19,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:19,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:54:19,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:54:19,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:54:19,124 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-18 17:54:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:20,153 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-18 17:54:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:54:20,153 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-18 17:54:20,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:20,154 INFO L225 Difference]: With dead ends: 142 [2019-01-18 17:54:20,154 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 17:54:20,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:54:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 17:54:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-18 17:54:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-18 17:54:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-18 17:54:20,157 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-18 17:54:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:20,157 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-18 17:54:20,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:54:20,157 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-18 17:54:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-18 17:54:20,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:20,158 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-18 17:54:20,158 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:20,158 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-18 17:54:20,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:20,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:20,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-18 17:54:21,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:21,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:21,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:21,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:21,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:21,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:21,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:21,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:21,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:21,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:21,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-18 17:54:21,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:24,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-18 17:54:24,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:24,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-18 17:54:24,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:24,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-18 17:54:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-18 17:54:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:54:24,632 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-18 17:54:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:24,863 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-18 17:54:24,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:54:24,866 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-18 17:54:24,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:24,867 INFO L225 Difference]: With dead ends: 145 [2019-01-18 17:54:24,867 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 17:54:24,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:54:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 17:54:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-18 17:54:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 17:54:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-18 17:54:24,871 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-18 17:54:24,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:24,871 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-18 17:54:24,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-18 17:54:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-18 17:54:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-18 17:54:24,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:24,872 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-18 17:54:24,873 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-18 17:54:24,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:24,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:24,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-18 17:54:25,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:25,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:25,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:25,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:25,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:25,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:25,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:25,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:25,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-18 17:54:25,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:28,630 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-18 17:54:28,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:28,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-18 17:54:28,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:28,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-18 17:54:28,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-18 17:54:28,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:54:28,650 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-18 17:54:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:28,826 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-18 17:54:28,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:54:28,827 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-18 17:54:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:28,828 INFO L225 Difference]: With dead ends: 148 [2019-01-18 17:54:28,828 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 17:54:28,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:54:28,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 17:54:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-18 17:54:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-18 17:54:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-18 17:54:28,831 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-18 17:54:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:28,831 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-18 17:54:28,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-18 17:54:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-18 17:54:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-18 17:54:28,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:28,832 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-18 17:54:28,832 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:28,832 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-18 17:54:28,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:28,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:28,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:28,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-18 17:54:30,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:30,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:30,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:30,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:30,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:30,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:30,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:30,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:30,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-18 17:54:30,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:30,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:30,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-18 17:54:30,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-18 17:54:33,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:33,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-18 17:54:33,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:33,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:54:33,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:54:33,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:54:33,199 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-18 17:54:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:33,395 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-18 17:54:33,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:54:33,395 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-18 17:54:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:33,396 INFO L225 Difference]: With dead ends: 151 [2019-01-18 17:54:33,396 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 17:54:33,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:54:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 17:54:33,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-18 17:54:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 17:54:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-18 17:54:33,399 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-18 17:54:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:33,399 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-18 17:54:33,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:54:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-18 17:54:33,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-18 17:54:33,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:33,400 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-18 17:54:33,400 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:33,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:33,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-18 17:54:33,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:33,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:33,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:33,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-18 17:54:34,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:34,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:34,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:34,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:34,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:34,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:34,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:34,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:34,490 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:34,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:34,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-18 17:54:34,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:37,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-18 17:54:37,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:37,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-18 17:54:37,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:37,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-18 17:54:37,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-18 17:54:37,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:54:37,029 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-18 17:54:37,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:37,274 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-18 17:54:37,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:54:37,274 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-18 17:54:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:37,275 INFO L225 Difference]: With dead ends: 154 [2019-01-18 17:54:37,275 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 17:54:37,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:54:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 17:54:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-18 17:54:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 17:54:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-18 17:54:37,279 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-18 17:54:37,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:37,280 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-18 17:54:37,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-18 17:54:37,280 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-18 17:54:37,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-18 17:54:37,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:37,280 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-18 17:54:37,280 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:37,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:37,281 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-18 17:54:37,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:37,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:37,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:37,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:37,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-18 17:54:38,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:38,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:38,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:38,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:38,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:38,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:38,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:38,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:38,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-18 17:54:38,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-18 17:54:41,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:41,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-18 17:54:41,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:41,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-18 17:54:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-18 17:54:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:54:41,455 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-18 17:54:41,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:41,710 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-18 17:54:41,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:54:41,710 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-18 17:54:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:41,711 INFO L225 Difference]: With dead ends: 157 [2019-01-18 17:54:41,711 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:54:41,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:54:41,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:54:41,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-18 17:54:41,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-18 17:54:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-18 17:54:41,715 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-18 17:54:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:41,715 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-18 17:54:41,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-18 17:54:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-18 17:54:41,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-18 17:54:41,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:41,716 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-18 17:54:41,716 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:41,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:41,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-18 17:54:41,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:41,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:41,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:41,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:41,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-18 17:54:42,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:42,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:42,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:42,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:42,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:42,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:42,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:42,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:43,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-18 17:54:43,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:43,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-18 17:54:43,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-18 17:54:46,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:46,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-18 17:54:46,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:46,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:54:46,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:54:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:54:46,707 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-18 17:54:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:47,573 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-18 17:54:47,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:54:47,574 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-18 17:54:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:47,575 INFO L225 Difference]: With dead ends: 160 [2019-01-18 17:54:47,575 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:54:47,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:54:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:54:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-18 17:54:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-18 17:54:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-18 17:54:47,579 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-18 17:54:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:47,579 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-18 17:54:47,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:54:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-18 17:54:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-18 17:54:47,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:47,580 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-18 17:54:47,581 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:47,581 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-18 17:54:47,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:47,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:47,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:47,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:47,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-18 17:54:48,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:48,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:48,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:48,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:48,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:48,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:48,967 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:48,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:49,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:49,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:49,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-18 17:54:49,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:51,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-18 17:54:51,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:51,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-18 17:54:51,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:51,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-18 17:54:51,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-18 17:54:51,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:54:51,834 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-18 17:54:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:52,088 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-18 17:54:52,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:54:52,088 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-18 17:54:52,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:52,089 INFO L225 Difference]: With dead ends: 163 [2019-01-18 17:54:52,089 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 17:54:52,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:54:52,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 17:54:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-18 17:54:52,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-18 17:54:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-18 17:54:52,093 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-18 17:54:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:52,093 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-18 17:54:52,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-18 17:54:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-18 17:54:52,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-18 17:54:52,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:52,094 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-18 17:54:52,095 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:52,095 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-18 17:54:52,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:52,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:52,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:52,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:52,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-18 17:54:54,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:54,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:54,248 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:54,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:54,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:54,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:54,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:54,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:54,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:54,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-18 17:54:54,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:57,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-18 17:54:57,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:57,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-18 17:54:57,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:57,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:54:57,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:54:57,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:54:57,317 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-18 17:54:57,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:57,573 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-18 17:54:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:54:57,573 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-18 17:54:57,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:57,574 INFO L225 Difference]: With dead ends: 166 [2019-01-18 17:54:57,574 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 17:54:57,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:54:57,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 17:54:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-18 17:54:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 17:54:57,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-18 17:54:57,577 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-18 17:54:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:57,577 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-18 17:54:57,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:54:57,578 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-18 17:54:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-18 17:54:57,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:57,578 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-18 17:54:57,578 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-18 17:54:57,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:57,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:57,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-18 17:54:59,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:59,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:59,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:59,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:59,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:59,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:59,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:59,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:00,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-18 17:55:00,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:00,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-18 17:55:00,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-18 17:55:03,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:03,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-18 17:55:03,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:03,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-18 17:55:03,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-18 17:55:03,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:55:03,539 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-18 17:55:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:03,841 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-18 17:55:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:55:03,842 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-18 17:55:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:03,842 INFO L225 Difference]: With dead ends: 169 [2019-01-18 17:55:03,842 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 17:55:03,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:55:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 17:55:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-18 17:55:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-18 17:55:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-18 17:55:03,846 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-18 17:55:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:03,846 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-18 17:55:03,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-18 17:55:03,846 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-18 17:55:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-18 17:55:03,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:03,847 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-18 17:55:03,847 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:03,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:03,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-18 17:55:03,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:03,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:03,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:03,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:03,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-18 17:55:05,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:05,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:05,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:05,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:05,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:05,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:05,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:05,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:05,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:05,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:05,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-18 17:55:05,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-18 17:55:08,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:08,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-18 17:55:08,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:08,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-18 17:55:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-18 17:55:08,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:55:08,194 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-18 17:55:08,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:08,466 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-18 17:55:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:55:08,466 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-18 17:55:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:08,467 INFO L225 Difference]: With dead ends: 172 [2019-01-18 17:55:08,467 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 17:55:08,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:55:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 17:55:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-18 17:55:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-18 17:55:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-18 17:55:08,471 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-18 17:55:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:08,472 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-18 17:55:08,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-18 17:55:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-18 17:55:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-18 17:55:08,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:08,473 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-18 17:55:08,473 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-18 17:55:08,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:08,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:08,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:08,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-18 17:55:09,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:09,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:09,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:09,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:09,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:09,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:09,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:09,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:09,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-18 17:55:09,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-18 17:55:13,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:13,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-18 17:55:13,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:13,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-18 17:55:13,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-18 17:55:13,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:55:13,269 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-18 17:55:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:13,737 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-18 17:55:13,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 17:55:13,738 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-18 17:55:13,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:13,738 INFO L225 Difference]: With dead ends: 175 [2019-01-18 17:55:13,738 INFO L226 Difference]: Without dead ends: 117 [2019-01-18 17:55:13,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:55:13,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-18 17:55:13,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-18 17:55:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-18 17:55:13,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-18 17:55:13,742 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-18 17:55:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:13,743 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-18 17:55:13,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-18 17:55:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-18 17:55:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-18 17:55:13,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:13,744 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-18 17:55:13,744 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:13,744 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-18 17:55:13,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:13,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:13,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:13,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:13,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-18 17:55:14,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:14,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:14,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:14,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:14,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:14,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:14,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:14,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:15,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-18 17:55:15,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:15,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-18 17:55:15,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:19,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-18 17:55:19,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:19,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-18 17:55:19,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:19,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:55:19,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:55:19,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:55:19,535 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-18 17:55:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:19,904 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-18 17:55:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:55:19,905 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-18 17:55:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:19,905 INFO L225 Difference]: With dead ends: 178 [2019-01-18 17:55:19,905 INFO L226 Difference]: Without dead ends: 119 [2019-01-18 17:55:19,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:55:19,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-18 17:55:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-18 17:55:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-18 17:55:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-18 17:55:19,908 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-18 17:55:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:19,909 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-18 17:55:19,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:55:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-18 17:55:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-18 17:55:19,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:19,910 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-18 17:55:19,910 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:19,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-18 17:55:19,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:19,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:19,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-18 17:55:21,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:21,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:21,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:21,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:21,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:21,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:21,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:21,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:21,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:21,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:21,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-18 17:55:21,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-18 17:55:25,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:25,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-18 17:55:25,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:25,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-18 17:55:25,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-18 17:55:25,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:55:25,129 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-18 17:55:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:25,453 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-18 17:55:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 17:55:25,454 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-18 17:55:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:25,454 INFO L225 Difference]: With dead ends: 181 [2019-01-18 17:55:25,454 INFO L226 Difference]: Without dead ends: 121 [2019-01-18 17:55:25,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:55:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-18 17:55:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-18 17:55:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-18 17:55:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-18 17:55:25,458 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-18 17:55:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:25,458 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-18 17:55:25,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-18 17:55:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-18 17:55:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-18 17:55:25,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:25,460 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-18 17:55:25,460 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:25,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-18 17:55:25,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:25,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:25,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-18 17:55:26,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:26,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:26,761 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:26,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:26,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:26,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:26,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:26,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:26,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:26,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-18 17:55:26,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:30,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-18 17:55:30,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:30,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-18 17:55:30,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:30,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-18 17:55:30,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-18 17:55:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:55:30,736 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-18 17:55:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:31,138 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-18 17:55:31,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 17:55:31,138 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-18 17:55:31,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:31,139 INFO L225 Difference]: With dead ends: 184 [2019-01-18 17:55:31,139 INFO L226 Difference]: Without dead ends: 123 [2019-01-18 17:55:31,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:55:31,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-18 17:55:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-18 17:55:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-18 17:55:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-18 17:55:31,143 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-18 17:55:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:31,144 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-18 17:55:31,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-18 17:55:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-18 17:55:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-18 17:55:31,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:31,145 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-18 17:55:31,145 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-18 17:55:31,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:31,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:31,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:31,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:31,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-18 17:55:32,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:32,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:32,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:32,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:32,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:32,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:32,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:32,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:33,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-18 17:55:33,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:33,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:33,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-18 17:55:33,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-18 17:55:37,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:37,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-18 17:55:37,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:37,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-18 17:55:37,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-18 17:55:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:55:37,583 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-18 17:55:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:37,942 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-18 17:55:37,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:55:37,942 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-18 17:55:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:37,943 INFO L225 Difference]: With dead ends: 187 [2019-01-18 17:55:37,943 INFO L226 Difference]: Without dead ends: 125 [2019-01-18 17:55:37,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:55:37,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-18 17:55:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-18 17:55:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-18 17:55:37,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-18 17:55:37,947 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-18 17:55:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:37,948 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-18 17:55:37,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-18 17:55:37,948 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-18 17:55:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-18 17:55:37,949 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:37,949 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-18 17:55:37,949 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:37,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-18 17:55:37,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:37,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:37,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:37,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:37,951 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-18 17:55:39,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:39,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:39,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:39,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:39,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:39,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:39,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:39,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:39,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:39,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:39,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-18 17:55:39,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-18 17:55:43,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:43,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-18 17:55:43,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:43,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-18 17:55:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-18 17:55:43,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:55:43,596 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-18 17:55:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:43,915 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-18 17:55:43,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:55:43,916 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-18 17:55:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:43,917 INFO L225 Difference]: With dead ends: 190 [2019-01-18 17:55:43,917 INFO L226 Difference]: Without dead ends: 127 [2019-01-18 17:55:43,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:55:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-18 17:55:43,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-18 17:55:43,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-18 17:55:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-18 17:55:43,920 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-18 17:55:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:43,921 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-18 17:55:43,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-18 17:55:43,921 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-18 17:55:43,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-18 17:55:43,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:43,921 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-18 17:55:43,921 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:43,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:43,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-18 17:55:43,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:43,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:43,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-18 17:55:45,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:45,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:45,612 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:45,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:45,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:45,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:45,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:45,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:45,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:45,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-18 17:55:45,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-18 17:55:50,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:50,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-18 17:55:50,021 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:50,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-18 17:55:50,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-18 17:55:50,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:55:50,023 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-18 17:55:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:50,437 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-18 17:55:50,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 17:55:50,437 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-18 17:55:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:50,438 INFO L225 Difference]: With dead ends: 193 [2019-01-18 17:55:50,438 INFO L226 Difference]: Without dead ends: 129 [2019-01-18 17:55:50,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:55:50,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-18 17:55:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-18 17:55:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-18 17:55:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-18 17:55:50,443 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-18 17:55:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:50,443 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-18 17:55:50,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-18 17:55:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-18 17:55:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-18 17:55:50,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:50,444 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-18 17:55:50,444 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:50,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:50,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-18 17:55:50,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:50,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:50,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:50,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-18 17:55:51,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:51,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:51,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:51,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:51,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:51,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:51,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:51,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:53,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-18 17:55:53,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:53,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-18 17:55:53,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:57,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-18 17:55:57,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:57,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-18 17:55:57,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:57,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:55:57,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:55:57,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:55:57,340 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-18 17:55:57,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:57,759 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-18 17:55:57,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 17:55:57,759 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-18 17:55:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:57,760 INFO L225 Difference]: With dead ends: 196 [2019-01-18 17:55:57,760 INFO L226 Difference]: Without dead ends: 131 [2019-01-18 17:55:57,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:55:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-18 17:55:57,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-18 17:55:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-18 17:55:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-18 17:55:57,763 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-18 17:55:57,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:57,763 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-18 17:55:57,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:55:57,764 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-18 17:55:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-18 17:55:57,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:57,764 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-18 17:55:57,764 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:57,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-18 17:55:57,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:57,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:57,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:57,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-18 17:55:59,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:59,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:59,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:59,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:59,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:59,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:59,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:59,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:59,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:59,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-18 17:55:59,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-18 17:56:03,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:03,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-18 17:56:03,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:03,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-18 17:56:03,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-18 17:56:03,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:56:03,889 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-18 17:56:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:04,351 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-18 17:56:04,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 17:56:04,351 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-18 17:56:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:04,352 INFO L225 Difference]: With dead ends: 199 [2019-01-18 17:56:04,352 INFO L226 Difference]: Without dead ends: 133 [2019-01-18 17:56:04,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:56:04,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-18 17:56:04,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-18 17:56:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-18 17:56:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-18 17:56:04,357 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-18 17:56:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:04,357 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-18 17:56:04,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-18 17:56:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-18 17:56:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-18 17:56:04,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:04,358 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-18 17:56:04,358 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:04,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:04,359 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-18 17:56:04,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:04,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:04,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:04,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-18 17:56:06,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:06,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:06,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:06,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:06,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:06,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:06,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:06,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:06,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-18 17:56:06,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:10,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-18 17:56:10,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:10,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-18 17:56:10,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:10,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-18 17:56:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-18 17:56:10,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:56:10,796 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-18 17:56:11,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:11,305 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-18 17:56:11,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:56:11,305 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-18 17:56:11,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:11,306 INFO L225 Difference]: With dead ends: 202 [2019-01-18 17:56:11,306 INFO L226 Difference]: Without dead ends: 135 [2019-01-18 17:56:11,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:56:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-18 17:56:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-18 17:56:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-18 17:56:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-18 17:56:11,310 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-18 17:56:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:11,310 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-18 17:56:11,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-18 17:56:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-18 17:56:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-18 17:56:11,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:11,310 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-18 17:56:11,311 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:11,311 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-18 17:56:11,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:11,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:11,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:11,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:11,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:12,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-18 17:56:12,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:12,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:12,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:12,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:12,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:12,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:12,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:56:12,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:56:15,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-18 17:56:15,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:15,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-18 17:56:15,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-18 17:56:21,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:21,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-18 17:56:21,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:21,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-18 17:56:21,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-18 17:56:21,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:56:21,665 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-18 17:56:22,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:22,101 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-18 17:56:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 17:56:22,102 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-18 17:56:22,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:22,102 INFO L225 Difference]: With dead ends: 205 [2019-01-18 17:56:22,102 INFO L226 Difference]: Without dead ends: 137 [2019-01-18 17:56:22,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:56:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-18 17:56:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-18 17:56:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-18 17:56:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-18 17:56:22,106 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-18 17:56:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:22,107 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-18 17:56:22,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-18 17:56:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-18 17:56:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-18 17:56:22,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:22,108 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-18 17:56:22,108 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:22,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-18 17:56:22,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:22,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:22,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:22,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-18 17:56:24,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:24,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:24,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:24,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:24,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:24,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:24,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:24,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:24,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:24,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:24,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:24,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-18 17:56:24,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-18 17:56:29,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:29,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-18 17:56:29,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:29,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-18 17:56:29,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-18 17:56:29,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:56:29,498 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-18 17:56:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:30,029 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-18 17:56:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 17:56:30,029 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-18 17:56:30,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:30,030 INFO L225 Difference]: With dead ends: 208 [2019-01-18 17:56:30,030 INFO L226 Difference]: Without dead ends: 139 [2019-01-18 17:56:30,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:56:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-18 17:56:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-18 17:56:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-18 17:56:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-18 17:56:30,033 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-18 17:56:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:30,033 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-18 17:56:30,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-18 17:56:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-18 17:56:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-18 17:56:30,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:30,034 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-18 17:56:30,034 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:30,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:30,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-18 17:56:30,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:30,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:30,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:30,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:30,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-18 17:56:32,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:32,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:32,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:32,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:32,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:32,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:32,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:32,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:32,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-18 17:56:32,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-18 17:56:37,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:37,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-18 17:56:37,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:37,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-18 17:56:37,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-18 17:56:37,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:56:37,026 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-18 17:56:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:37,577 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-18 17:56:37,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 17:56:37,577 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-18 17:56:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:37,578 INFO L225 Difference]: With dead ends: 211 [2019-01-18 17:56:37,578 INFO L226 Difference]: Without dead ends: 141 [2019-01-18 17:56:37,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:56:37,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-18 17:56:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-18 17:56:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-18 17:56:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-18 17:56:37,581 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-18 17:56:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:37,582 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-18 17:56:37,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-18 17:56:37,582 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-18 17:56:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-18 17:56:37,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:37,583 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-18 17:56:37,583 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:37,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:37,583 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-18 17:56:37,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:37,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:37,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:37,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:37,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-18 17:56:39,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:39,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:39,311 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:39,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:39,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:39,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:39,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:56:39,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:56:42,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-18 17:56:42,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:42,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-18 17:56:42,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-18 17:56:47,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:47,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-18 17:56:47,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:47,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:56:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:56:47,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:56:47,957 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-18 17:56:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:48,550 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-18 17:56:48,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 17:56:48,550 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-18 17:56:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:48,551 INFO L225 Difference]: With dead ends: 214 [2019-01-18 17:56:48,551 INFO L226 Difference]: Without dead ends: 143 [2019-01-18 17:56:48,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:56:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-18 17:56:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-18 17:56:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-18 17:56:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-18 17:56:48,554 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-18 17:56:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:48,554 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-18 17:56:48,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:56:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-18 17:56:48,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-18 17:56:48,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:48,555 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-18 17:56:48,555 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-18 17:56:48,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:48,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:48,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:48,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:48,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-18 17:56:50,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:50,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:50,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:50,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:50,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:50,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:50,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:50,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:50,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:50,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:50,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-18 17:56:50,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-18 17:56:55,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:55,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-18 17:56:55,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:55,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-18 17:56:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-18 17:56:55,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:56:55,602 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-18 17:56:56,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:56,169 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-18 17:56:56,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 17:56:56,169 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-18 17:56:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:56,170 INFO L225 Difference]: With dead ends: 217 [2019-01-18 17:56:56,170 INFO L226 Difference]: Without dead ends: 145 [2019-01-18 17:56:56,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:56:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-18 17:56:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-18 17:56:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-18 17:56:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-18 17:56:56,174 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-18 17:56:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:56,174 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-18 17:56:56,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-18 17:56:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-18 17:56:56,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-18 17:56:56,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:56,175 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-18 17:56:56,175 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-18 17:56:56,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:56,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:56,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:56,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-18 17:56:58,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:58,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:58,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:58,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:58,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:58,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:58,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:58,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:58,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:58,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-18 17:56:58,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-18 17:57:03,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:03,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-18 17:57:03,651 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:03,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-18 17:57:03,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-18 17:57:03,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:57:03,653 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-18 17:57:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:04,132 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-18 17:57:04,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-18 17:57:04,132 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-18 17:57:04,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:04,133 INFO L225 Difference]: With dead ends: 220 [2019-01-18 17:57:04,133 INFO L226 Difference]: Without dead ends: 147 [2019-01-18 17:57:04,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:57:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-18 17:57:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-18 17:57:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-18 17:57:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-18 17:57:04,138 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-18 17:57:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:04,139 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-18 17:57:04,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-18 17:57:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-18 17:57:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-18 17:57:04,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:04,140 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-18 17:57:04,140 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:04,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-18 17:57:04,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:04,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:04,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-18 17:57:06,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:06,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:06,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:06,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:06,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:06,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:06,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:06,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:08,754 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-18 17:57:08,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:08,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-18 17:57:08,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-18 17:57:14,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:14,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-18 17:57:14,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:14,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:57:14,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:57:14,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:57:14,280 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-18 17:57:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:14,925 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-18 17:57:14,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-18 17:57:14,926 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-18 17:57:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:14,926 INFO L225 Difference]: With dead ends: 223 [2019-01-18 17:57:14,926 INFO L226 Difference]: Without dead ends: 149 [2019-01-18 17:57:14,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:57:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-18 17:57:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-18 17:57:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-18 17:57:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-18 17:57:14,931 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-18 17:57:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:14,931 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-18 17:57:14,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:57:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-18 17:57:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-18 17:57:14,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:14,932 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-18 17:57:14,932 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:14,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-18 17:57:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:14,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:14,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:17,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-18 17:57:17,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:17,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:17,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:17,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:17,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:17,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:17,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:17,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:17,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:17,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:17,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-18 17:57:17,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-18 17:57:23,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:23,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-18 17:57:23,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:23,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-18 17:57:23,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-18 17:57:23,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:57:23,036 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-18 17:57:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:23,646 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-18 17:57:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 17:57:23,646 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-18 17:57:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:23,647 INFO L225 Difference]: With dead ends: 226 [2019-01-18 17:57:23,647 INFO L226 Difference]: Without dead ends: 151 [2019-01-18 17:57:23,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:57:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-18 17:57:23,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-18 17:57:23,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-18 17:57:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-18 17:57:23,651 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-18 17:57:23,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:23,652 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-18 17:57:23,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-18 17:57:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-18 17:57:23,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-18 17:57:23,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:23,653 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-18 17:57:23,653 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:23,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:23,653 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-18 17:57:23,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:23,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:23,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:23,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:23,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-18 17:57:25,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:25,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:25,659 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:25,659 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:25,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:25,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:25,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:25,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:25,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-18 17:57:25,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-18 17:57:31,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:31,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-18 17:57:31,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:31,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-18 17:57:31,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-18 17:57:31,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:57:31,707 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-18 17:57:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:32,383 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-18 17:57:32,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-18 17:57:32,384 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-18 17:57:32,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:32,384 INFO L225 Difference]: With dead ends: 229 [2019-01-18 17:57:32,384 INFO L226 Difference]: Without dead ends: 153 [2019-01-18 17:57:32,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:57:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-18 17:57:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-18 17:57:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-18 17:57:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-18 17:57:32,389 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-18 17:57:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:32,389 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-18 17:57:32,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-18 17:57:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-18 17:57:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-18 17:57:32,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:32,390 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-18 17:57:32,391 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-18 17:57:32,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:32,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:32,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:32,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:32,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:34,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-18 17:57:34,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:34,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:34,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:34,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:34,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:34,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:34,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:34,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:36,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-18 17:57:36,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:36,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-18 17:57:36,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-18 17:57:42,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:42,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-18 17:57:42,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:42,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:57:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:57:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:57:42,975 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-18 17:57:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:43,651 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-18 17:57:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-18 17:57:43,651 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-18 17:57:43,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:43,652 INFO L225 Difference]: With dead ends: 232 [2019-01-18 17:57:43,652 INFO L226 Difference]: Without dead ends: 155 [2019-01-18 17:57:43,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:57:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-18 17:57:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-18 17:57:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-18 17:57:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-18 17:57:43,656 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-18 17:57:43,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:43,657 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-18 17:57:43,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:57:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-18 17:57:43,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-18 17:57:43,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:43,657 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-18 17:57:43,658 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:43,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-18 17:57:43,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:43,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:43,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:43,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:43,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-18 17:57:45,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:45,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:45,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:45,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:45,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:45,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:45,797 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:45,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:45,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:45,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:45,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-18 17:57:45,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-18 17:57:52,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:52,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-18 17:57:52,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:52,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-18 17:57:52,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-18 17:57:52,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:57:52,046 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-18 17:57:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:52,803 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-18 17:57:52,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-18 17:57:52,803 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-18 17:57:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:52,804 INFO L225 Difference]: With dead ends: 235 [2019-01-18 17:57:52,804 INFO L226 Difference]: Without dead ends: 157 [2019-01-18 17:57:52,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:57:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-18 17:57:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-18 17:57:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-18 17:57:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-18 17:57:52,807 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-18 17:57:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:52,808 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-18 17:57:52,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-18 17:57:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-18 17:57:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-18 17:57:52,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:52,808 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-18 17:57:52,808 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:52,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:52,809 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-18 17:57:52,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:52,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:52,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:52,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:52,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-18 17:57:54,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:54,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:54,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:54,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:54,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:54,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:54,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:54,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:55,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-18 17:57:55,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-18 17:58:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:01,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-18 17:58:01,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:01,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-18 17:58:01,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-18 17:58:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:58:01,354 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-18 17:58:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:02,027 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-18 17:58:02,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-18 17:58:02,027 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-18 17:58:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:02,028 INFO L225 Difference]: With dead ends: 238 [2019-01-18 17:58:02,028 INFO L226 Difference]: Without dead ends: 159 [2019-01-18 17:58:02,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:58:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-18 17:58:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-18 17:58:02,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-18 17:58:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-18 17:58:02,031 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-18 17:58:02,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:02,032 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-18 17:58:02,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-18 17:58:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-18 17:58:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-18 17:58:02,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:02,033 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-18 17:58:02,033 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:02,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:02,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-18 17:58:02,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:02,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:02,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:02,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:02,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-18 17:58:04,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:04,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:04,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:04,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:04,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:04,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:04,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:04,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:08,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-18 17:58:08,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:08,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-18 17:58:08,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:15,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-18 17:58:15,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:15,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-18 17:58:15,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:15,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:58:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:58:15,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:58:15,230 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-18 17:58:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:16,050 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-18 17:58:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 17:58:16,051 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-18 17:58:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:16,051 INFO L225 Difference]: With dead ends: 241 [2019-01-18 17:58:16,051 INFO L226 Difference]: Without dead ends: 161 [2019-01-18 17:58:16,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:58:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-18 17:58:16,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-18 17:58:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-18 17:58:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-18 17:58:16,056 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-18 17:58:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:16,056 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-18 17:58:16,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:58:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-18 17:58:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-18 17:58:16,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:16,058 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-18 17:58:16,058 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:16,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:16,058 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-18 17:58:16,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:16,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:16,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:16,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:16,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-18 17:58:18,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:18,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:18,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:18,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:18,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:18,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:18,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:18,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:18,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:18,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:18,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:18,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-18 17:58:18,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-18 17:58:25,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:25,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-18 17:58:25,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:25,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-18 17:58:25,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-18 17:58:25,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:58:25,222 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-18 17:58:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:26,071 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-18 17:58:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-18 17:58:26,071 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-18 17:58:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:26,072 INFO L225 Difference]: With dead ends: 244 [2019-01-18 17:58:26,072 INFO L226 Difference]: Without dead ends: 163 [2019-01-18 17:58:26,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:58:26,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-18 17:58:26,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-18 17:58:26,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-18 17:58:26,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-18 17:58:26,077 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-18 17:58:26,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:26,077 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-18 17:58:26,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-18 17:58:26,078 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-18 17:58:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-18 17:58:26,078 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:26,078 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-18 17:58:26,079 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:26,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-18 17:58:26,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:26,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:26,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:26,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:26,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:28,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-18 17:58:28,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:28,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:28,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:28,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:28,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:28,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:28,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:28,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:29,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-18 17:58:29,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-18 17:58:35,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:35,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-18 17:58:35,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:35,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-18 17:58:35,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-18 17:58:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:58:35,886 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-18 17:58:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:36,787 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-18 17:58:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-18 17:58:36,787 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-18 17:58:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:36,788 INFO L225 Difference]: With dead ends: 247 [2019-01-18 17:58:36,788 INFO L226 Difference]: Without dead ends: 165 [2019-01-18 17:58:36,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:58:36,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-18 17:58:36,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-18 17:58:36,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-18 17:58:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-18 17:58:36,791 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-18 17:58:36,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:36,792 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-18 17:58:36,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-18 17:58:36,792 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-18 17:58:36,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-18 17:58:36,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:36,793 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-18 17:58:36,793 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-18 17:58:36,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:36,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:36,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:36,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-18 17:58:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:39,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:39,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:39,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:39,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:39,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:39,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:42,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-18 17:58:42,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:42,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:42,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-18 17:58:42,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-18 17:58:49,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:49,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-18 17:58:49,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:49,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:58:49,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:58:49,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:58:49,562 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-18 17:58:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:50,449 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-18 17:58:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 17:58:50,449 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-18 17:58:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:50,450 INFO L225 Difference]: With dead ends: 250 [2019-01-18 17:58:50,450 INFO L226 Difference]: Without dead ends: 167 [2019-01-18 17:58:50,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:58:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-18 17:58:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-18 17:58:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-18 17:58:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-18 17:58:50,455 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-18 17:58:50,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:50,455 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-18 17:58:50,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:58:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-18 17:58:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-18 17:58:50,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:50,456 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-18 17:58:50,457 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:50,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-18 17:58:50,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:50,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:50,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:50,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:53,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-18 17:58:53,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:53,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:53,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:53,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:53,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:53,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:53,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:53,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:53,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:53,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:53,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:53,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-18 17:58:53,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-18 17:59:00,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:00,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-18 17:59:00,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:00,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-18 17:59:00,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-18 17:59:00,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:59:00,521 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-18 17:59:01,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:01,283 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-18 17:59:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-18 17:59:01,283 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-18 17:59:01,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:01,284 INFO L225 Difference]: With dead ends: 253 [2019-01-18 17:59:01,284 INFO L226 Difference]: Without dead ends: 169 [2019-01-18 17:59:01,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:59:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-18 17:59:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-18 17:59:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-18 17:59:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-18 17:59:01,288 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-18 17:59:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:01,288 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-18 17:59:01,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-18 17:59:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-18 17:59:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-18 17:59:01,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:01,290 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-18 17:59:01,290 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:01,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:01,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-18 17:59:01,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:01,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:01,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:01,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-18 17:59:03,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:03,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:03,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:03,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:03,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:03,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:03,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:03,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:03,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-18 17:59:03,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:11,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-18 17:59:11,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:11,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-18 17:59:11,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:11,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-18 17:59:11,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-18 17:59:11,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:59:11,333 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-18 17:59:12,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:12,267 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-18 17:59:12,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-18 17:59:12,268 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-18 17:59:12,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:12,268 INFO L225 Difference]: With dead ends: 256 [2019-01-18 17:59:12,268 INFO L226 Difference]: Without dead ends: 171 [2019-01-18 17:59:12,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:59:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-18 17:59:12,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-18 17:59:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-18 17:59:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-18 17:59:12,272 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-18 17:59:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:12,272 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-18 17:59:12,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-18 17:59:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-18 17:59:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-18 17:59:12,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:12,273 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-18 17:59:12,273 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:12,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-18 17:59:12,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:12,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:12,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:12,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:15,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-18 17:59:15,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:15,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:15,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:15,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:15,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:15,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:15,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:15,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:23,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-18 17:59:23,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:23,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-18 17:59:23,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-18 17:59:31,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:31,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-18 17:59:31,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:31,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 17:59:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 17:59:31,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:59:31,496 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-18 17:59:32,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:32,501 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-18 17:59:32,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 17:59:32,501 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-18 17:59:32,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:32,502 INFO L225 Difference]: With dead ends: 259 [2019-01-18 17:59:32,502 INFO L226 Difference]: Without dead ends: 173 [2019-01-18 17:59:32,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:59:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-18 17:59:32,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-18 17:59:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-18 17:59:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-18 17:59:32,505 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-18 17:59:32,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:32,506 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-18 17:59:32,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 17:59:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-18 17:59:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-18 17:59:32,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:32,507 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-18 17:59:32,507 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-18 17:59:32,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:32,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:32,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:32,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:35,303 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-18 17:59:35,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:35,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:35,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:35,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:35,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:35,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:35,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:35,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:35,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:35,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:35,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-18 17:59:35,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-18 17:59:42,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:42,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-18 17:59:42,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:42,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-18 17:59:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-18 17:59:42,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:59:42,975 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-18 17:59:44,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:44,053 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-18 17:59:44,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-18 17:59:44,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-18 17:59:44,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:44,054 INFO L225 Difference]: With dead ends: 262 [2019-01-18 17:59:44,054 INFO L226 Difference]: Without dead ends: 175 [2019-01-18 17:59:44,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:59:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-18 17:59:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-18 17:59:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-18 17:59:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-18 17:59:44,059 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-18 17:59:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:44,059 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-18 17:59:44,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-18 17:59:44,059 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-18 17:59:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-18 17:59:44,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:44,060 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-18 17:59:44,063 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-18 17:59:44,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:44,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:44,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-18 17:59:47,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:47,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:47,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:47,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:47,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:47,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:47,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:47,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:47,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:47,174 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-18 17:59:47,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-18 17:59:54,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:54,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-18 17:59:54,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:54,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-18 17:59:54,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-18 17:59:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:59:54,978 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-18 17:59:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:55,997 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-18 17:59:55,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-18 17:59:55,997 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-18 17:59:55,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:55,998 INFO L225 Difference]: With dead ends: 265 [2019-01-18 17:59:55,998 INFO L226 Difference]: Without dead ends: 177 [2019-01-18 17:59:55,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:59:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-18 17:59:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-18 17:59:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-18 17:59:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-18 17:59:56,002 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-18 17:59:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:56,003 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-18 17:59:56,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-18 17:59:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-18 17:59:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-18 17:59:56,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:56,004 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-18 17:59:56,004 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:56,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-18 17:59:56,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:56,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:56,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:56,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-18 17:59:58,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:58,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:58,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:58,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:58,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:58,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:58,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:58,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:00:07,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-18 18:00:07,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:07,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-18 18:00:07,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-18 18:00:16,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:16,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-18 18:00:16,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:16,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 18:00:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 18:00:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 18:00:16,046 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-18 18:00:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:16,970 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-18 18:00:16,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-18 18:00:16,970 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-18 18:00:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:16,971 INFO L225 Difference]: With dead ends: 268 [2019-01-18 18:00:16,971 INFO L226 Difference]: Without dead ends: 179 [2019-01-18 18:00:16,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 18:00:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-18 18:00:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-18 18:00:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-18 18:00:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-18 18:00:16,975 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-18 18:00:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:16,975 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-18 18:00:16,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 18:00:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-18 18:00:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-18 18:00:16,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:16,976 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-18 18:00:16,976 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-18 18:00:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:16,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:16,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-18 18:00:19,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:19,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:19,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:19,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:19,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:19,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:19,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:00:19,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:00:19,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:00:19,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:19,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-18 18:00:19,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-18 18:00:28,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:28,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-18 18:00:28,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:28,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-18 18:00:28,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-18 18:00:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 18:00:28,467 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-18 18:00:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:29,619 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-18 18:00:29,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-18 18:00:29,619 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-18 18:00:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:29,620 INFO L225 Difference]: With dead ends: 271 [2019-01-18 18:00:29,620 INFO L226 Difference]: Without dead ends: 181 [2019-01-18 18:00:29,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 18:00:29,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-18 18:00:29,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-18 18:00:29,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-18 18:00:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-18 18:00:29,624 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-18 18:00:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:29,624 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-18 18:00:29,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-18 18:00:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-18 18:00:29,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-18 18:00:29,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:29,625 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-18 18:00:29,625 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:29,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-18 18:00:29,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:29,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:29,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:29,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-18 18:00:32,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:32,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:32,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:32,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:32,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:32,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:32,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:32,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:32,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-18 18:00:32,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-18 18:00:41,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:41,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-18 18:00:41,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:41,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-18 18:00:41,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-18 18:00:41,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 18:00:41,397 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-18 18:00:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:42,338 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-18 18:00:42,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-18 18:00:42,338 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-18 18:00:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:42,339 INFO L225 Difference]: With dead ends: 274 [2019-01-18 18:00:42,339 INFO L226 Difference]: Without dead ends: 183 [2019-01-18 18:00:42,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 18:00:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-18 18:00:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-18 18:00:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-18 18:00:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-18 18:00:42,343 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-18 18:00:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:42,343 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-18 18:00:42,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-18 18:00:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-18 18:00:42,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-18 18:00:42,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:42,344 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-18 18:00:42,344 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-18 18:00:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:42,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:42,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-18 18:00:45,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:45,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:45,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:45,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:45,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:45,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:45,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:00:45,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:00:49,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-18 18:00:49,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:49,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:49,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-18 18:00:49,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-18 18:00:58,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:58,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-18 18:00:58,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:58,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 18:00:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 18:00:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 18:00:58,679 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-18 18:00:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:59,596 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-18 18:00:59,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-18 18:00:59,596 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-18 18:00:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:59,597 INFO L225 Difference]: With dead ends: 277 [2019-01-18 18:00:59,597 INFO L226 Difference]: Without dead ends: 185 [2019-01-18 18:00:59,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 18:00:59,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-18 18:00:59,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-18 18:00:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-18 18:00:59,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-18 18:00:59,601 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-18 18:00:59,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:59,601 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-18 18:00:59,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 18:00:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-18 18:00:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-18 18:00:59,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:59,602 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-18 18:00:59,602 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:59,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:59,603 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-18 18:00:59,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:59,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:59,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:59,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-18 18:01:02,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:02,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:02,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:02,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:02,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:02,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:02,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:01:02,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:01:02,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:01:02,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:02,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-18 18:01:02,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-18 18:01:11,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:11,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-18 18:01:11,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:11,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-18 18:01:11,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-18 18:01:11,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:01:11,637 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-18 18:01:12,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:12,569 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-18 18:01:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-18 18:01:12,569 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-18 18:01:12,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:12,570 INFO L225 Difference]: With dead ends: 280 [2019-01-18 18:01:12,570 INFO L226 Difference]: Without dead ends: 187 [2019-01-18 18:01:12,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:01:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-18 18:01:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-18 18:01:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-18 18:01:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-18 18:01:12,575 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-18 18:01:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:12,575 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-18 18:01:12,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-18 18:01:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-18 18:01:12,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-18 18:01:12,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:12,576 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-18 18:01:12,577 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:12,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:12,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-18 18:01:12,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:12,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:12,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:12,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:12,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-18 18:01:15,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:15,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:15,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:15,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:15,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:15,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:15,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:15,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:01:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:15,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-18 18:01:15,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:24,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-18 18:01:24,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:24,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-18 18:01:24,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:24,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-18 18:01:24,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-18 18:01:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 18:01:24,770 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-01-18 18:01:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:26,104 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-01-18 18:01:26,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-18 18:01:26,104 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-01-18 18:01:26,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:26,105 INFO L225 Difference]: With dead ends: 283 [2019-01-18 18:01:26,105 INFO L226 Difference]: Without dead ends: 189 [2019-01-18 18:01:26,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 18:01:26,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-18 18:01:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-18 18:01:26,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-18 18:01:26,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-01-18 18:01:26,111 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-01-18 18:01:26,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:26,111 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-01-18 18:01:26,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-18 18:01:26,111 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-01-18 18:01:26,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-18 18:01:26,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:26,112 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-01-18 18:01:26,112 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-01-18 18:01:26,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:26,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:26,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:26,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-18 18:01:29,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:29,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:29,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:29,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:29,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:29,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:29,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:01:29,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:01:34,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-18 18:01:34,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:34,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-18 18:01:34,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-18 18:01:43,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:43,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-18 18:01:43,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:43,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 18:01:43,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 18:01:43,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 18:01:43,752 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-01-18 18:01:44,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:44,939 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-18 18:01:44,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-18 18:01:44,939 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-01-18 18:01:44,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:44,940 INFO L225 Difference]: With dead ends: 286 [2019-01-18 18:01:44,940 INFO L226 Difference]: Without dead ends: 191 [2019-01-18 18:01:44,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 18:01:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-18 18:01:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-01-18 18:01:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-18 18:01:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-01-18 18:01:44,946 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-01-18 18:01:44,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:44,946 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-01-18 18:01:44,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 18:01:44,946 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-01-18 18:01:44,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-18 18:01:44,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:44,947 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-01-18 18:01:44,948 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:44,948 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-01-18 18:01:44,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:44,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:44,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:44,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:44,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-18 18:01:48,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:48,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:48,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:48,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:48,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:48,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:48,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:01:48,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:01:48,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:01:48,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:48,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:48,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-18 18:01:48,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:57,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-18 18:01:57,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:57,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-18 18:01:57,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:57,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-18 18:01:57,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-18 18:01:57,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:01:57,795 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-01-18 18:01:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:59,161 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-01-18 18:01:59,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-18 18:01:59,161 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-01-18 18:01:59,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:59,162 INFO L225 Difference]: With dead ends: 289 [2019-01-18 18:01:59,162 INFO L226 Difference]: Without dead ends: 193 [2019-01-18 18:01:59,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:01:59,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-18 18:01:59,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-18 18:01:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-18 18:01:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-01-18 18:01:59,167 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-01-18 18:01:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:59,168 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-01-18 18:01:59,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-18 18:01:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-01-18 18:01:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-18 18:01:59,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:59,169 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-01-18 18:01:59,169 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-01-18 18:01:59,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:59,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:59,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:59,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:59,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:02,390 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-18 18:02:02,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:02,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:02,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:02,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:02,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:02,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:02,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:02,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:02:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:02,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-18 18:02:02,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-18 18:02:12,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:12,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-18 18:02:12,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:12,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-18 18:02:12,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-18 18:02:12,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 18:02:12,196 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-01-18 18:02:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:13,615 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-18 18:02:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-18 18:02:13,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-01-18 18:02:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:13,616 INFO L225 Difference]: With dead ends: 292 [2019-01-18 18:02:13,616 INFO L226 Difference]: Without dead ends: 195 [2019-01-18 18:02:13,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 18:02:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-18 18:02:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-18 18:02:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-18 18:02:13,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-01-18 18:02:13,621 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-01-18 18:02:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:13,622 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-01-18 18:02:13,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-18 18:02:13,622 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-01-18 18:02:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-18 18:02:13,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:13,623 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-01-18 18:02:13,623 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:13,623 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-01-18 18:02:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:13,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:13,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:13,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:13,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-18 18:02:16,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:16,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:16,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:16,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:16,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:16,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:16,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:02:16,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:02:22,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-18 18:02:22,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:22,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-18 18:02:22,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:32,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-18 18:02:32,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:32,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-18 18:02:32,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:32,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-18 18:02:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-18 18:02:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 18:02:32,586 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-01-18 18:02:34,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:34,204 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-01-18 18:02:34,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-18 18:02:34,204 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-01-18 18:02:34,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:34,205 INFO L225 Difference]: With dead ends: 295 [2019-01-18 18:02:34,205 INFO L226 Difference]: Without dead ends: 197 [2019-01-18 18:02:34,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 18:02:34,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-18 18:02:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-18 18:02:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-18 18:02:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-01-18 18:02:34,210 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-01-18 18:02:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:34,211 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-01-18 18:02:34,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-18 18:02:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-01-18 18:02:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-18 18:02:34,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:34,212 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-01-18 18:02:34,212 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:34,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-01-18 18:02:34,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:34,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:34,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:37,534 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-18 18:02:37,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:37,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:37,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:37,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:37,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:37,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:37,543 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:37,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:37,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:37,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:37,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-18 18:02:37,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-18 18:02:47,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:47,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-18 18:02:47,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:47,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-18 18:02:47,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-18 18:02:47,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 18:02:47,805 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-01-18 18:02:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:49,451 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-01-18 18:02:49,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-18 18:02:49,451 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-01-18 18:02:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:49,452 INFO L225 Difference]: With dead ends: 298 [2019-01-18 18:02:49,452 INFO L226 Difference]: Without dead ends: 199 [2019-01-18 18:02:49,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 18:02:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-18 18:02:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-01-18 18:02:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-18 18:02:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-01-18 18:02:49,456 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-01-18 18:02:49,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:49,456 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-01-18 18:02:49,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-18 18:02:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-01-18 18:02:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-18 18:02:49,457 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:49,457 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-01-18 18:02:49,457 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:49,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:49,457 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-01-18 18:02:49,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:49,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:49,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:49,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:49,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-18 18:02:52,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:52,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:52,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:52,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:52,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:52,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:52,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:52,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:02:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:52,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-18 18:02:52,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-18 18:03:03,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:03,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-18 18:03:03,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:03,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-18 18:03:03,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-18 18:03:03,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 18:03:03,157 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-01-18 18:03:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:04,498 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-01-18 18:03:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-18 18:03:04,498 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-01-18 18:03:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:04,499 INFO L225 Difference]: With dead ends: 301 [2019-01-18 18:03:04,499 INFO L226 Difference]: Without dead ends: 201 [2019-01-18 18:03:04,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 18:03:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-18 18:03:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-18 18:03:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-18 18:03:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-01-18 18:03:04,503 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-01-18 18:03:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:04,503 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-01-18 18:03:04,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-18 18:03:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-01-18 18:03:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-18 18:03:04,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:04,504 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-01-18 18:03:04,504 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:04,505 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-01-18 18:03:04,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:04,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:04,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:08,069 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-18 18:03:08,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:08,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:08,070 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:08,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:08,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:08,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:08,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:03:08,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:03:22,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-18 18:03:22,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:22,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:22,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-18 18:03:22,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:33,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-18 18:03:33,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:33,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-18 18:03:33,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:33,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 18:03:33,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 18:03:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 18:03:33,353 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-01-18 18:03:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:35,031 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-01-18 18:03:35,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-18 18:03:35,032 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-01-18 18:03:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:35,032 INFO L225 Difference]: With dead ends: 304 [2019-01-18 18:03:35,032 INFO L226 Difference]: Without dead ends: 203 [2019-01-18 18:03:35,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 18:03:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-18 18:03:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-18 18:03:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-18 18:03:35,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-01-18 18:03:35,036 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-01-18 18:03:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:35,036 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-01-18 18:03:35,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 18:03:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-01-18 18:03:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-18 18:03:35,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:35,037 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-01-18 18:03:35,037 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:35,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:35,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-01-18 18:03:35,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:35,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:35,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:35,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:35,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:38,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-18 18:03:38,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:38,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:38,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:38,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:38,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:38,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:38,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:03:38,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:03:38,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:03:38,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:38,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-18 18:03:39,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-18 18:03:49,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:49,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-18 18:03:49,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:49,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-18 18:03:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-18 18:03:49,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:03:49,777 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-01-18 18:03:51,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:51,528 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-01-18 18:03:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-18 18:03:51,528 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-01-18 18:03:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:51,529 INFO L225 Difference]: With dead ends: 307 [2019-01-18 18:03:51,529 INFO L226 Difference]: Without dead ends: 205 [2019-01-18 18:03:51,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:03:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-18 18:03:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-01-18 18:03:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-18 18:03:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-01-18 18:03:51,534 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-01-18 18:03:51,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:51,534 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-01-18 18:03:51,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-18 18:03:51,534 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-01-18 18:03:51,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-18 18:03:51,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:51,535 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-01-18 18:03:51,535 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:51,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-01-18 18:03:51,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:51,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:51,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:51,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:55,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-18 18:03:55,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:55,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:55,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:55,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:55,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:55,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:55,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:03:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:55,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-18 18:03:55,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-18 18:04:06,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:06,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-18 18:04:06,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:06,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-18 18:04:06,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-18 18:04:06,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 18:04:06,311 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-01-18 18:04:08,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:08,022 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-01-18 18:04:08,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-18 18:04:08,022 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-01-18 18:04:08,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:08,023 INFO L225 Difference]: With dead ends: 310 [2019-01-18 18:04:08,023 INFO L226 Difference]: Without dead ends: 207 [2019-01-18 18:04:08,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 18:04:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-18 18:04:08,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-18 18:04:08,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-18 18:04:08,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-01-18 18:04:08,030 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-01-18 18:04:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:08,030 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-01-18 18:04:08,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-18 18:04:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-01-18 18:04:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-18 18:04:08,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:08,031 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-01-18 18:04:08,031 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:08,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:08,032 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-01-18 18:04:08,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:08,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:08,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:08,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:08,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:11,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-18 18:04:11,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:11,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:11,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:11,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:11,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:11,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:11,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:04:11,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:04:30,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-18 18:04:30,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:30,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-18 18:04:30,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-18 18:04:41,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:41,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-18 18:04:41,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:41,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-18 18:04:41,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-18 18:04:41,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 18:04:41,260 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-01-18 18:04:43,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:43,080 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-01-18 18:04:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-18 18:04:43,080 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-01-18 18:04:43,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:43,081 INFO L225 Difference]: With dead ends: 313 [2019-01-18 18:04:43,082 INFO L226 Difference]: Without dead ends: 209 [2019-01-18 18:04:43,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 18:04:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-18 18:04:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-18 18:04:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-18 18:04:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-01-18 18:04:43,088 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-01-18 18:04:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:43,088 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-01-18 18:04:43,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-18 18:04:43,088 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-01-18 18:04:43,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-18 18:04:43,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:43,089 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-01-18 18:04:43,089 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:43,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:43,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-01-18 18:04:43,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:43,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:43,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:43,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:43,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-18 18:04:46,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:46,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:46,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:46,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:46,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:46,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:46,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:04:46,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:04:47,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:04:47,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:47,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-18 18:04:47,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-18 18:04:58,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:58,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-18 18:04:58,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:58,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-18 18:04:58,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-18 18:04:58,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 18:04:58,407 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-01-18 18:04:59,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:59,966 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-01-18 18:04:59,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-18 18:04:59,966 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-01-18 18:04:59,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:59,967 INFO L225 Difference]: With dead ends: 316 [2019-01-18 18:04:59,967 INFO L226 Difference]: Without dead ends: 211 [2019-01-18 18:04:59,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 18:04:59,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-18 18:04:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-01-18 18:04:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-18 18:04:59,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-01-18 18:04:59,973 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-01-18 18:04:59,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:59,973 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-01-18 18:04:59,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-18 18:04:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-01-18 18:04:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-18 18:04:59,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:59,974 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-01-18 18:04:59,974 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-01-18 18:04:59,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:59,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:59,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-18 18:05:03,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:03,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:03,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:03,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:03,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:03,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:03,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:05:03,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:05:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:04,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-18 18:05:04,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-18 18:05:15,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:15,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-18 18:05:15,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:15,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-18 18:05:15,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-18 18:05:15,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 18:05:15,651 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-01-18 18:05:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:17,491 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-01-18 18:05:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-18 18:05:17,491 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-01-18 18:05:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:17,492 INFO L225 Difference]: With dead ends: 319 [2019-01-18 18:05:17,492 INFO L226 Difference]: Without dead ends: 213 [2019-01-18 18:05:17,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 18:05:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-18 18:05:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-18 18:05:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-18 18:05:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-01-18 18:05:17,498 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-01-18 18:05:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:17,498 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-01-18 18:05:17,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-18 18:05:17,498 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-01-18 18:05:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-18 18:05:17,499 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:17,499 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-01-18 18:05:17,500 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:17,500 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-01-18 18:05:17,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:17,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:05:17,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:17,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-18 18:05:21,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:21,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:21,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:21,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:21,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:21,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:21,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:05:21,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:05:29,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-18 18:05:29,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:29,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-18 18:05:29,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:41,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-18 18:05:41,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:41,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-18 18:05:41,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:41,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 18:05:41,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 18:05:41,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 18:05:41,505 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-01-18 18:05:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:43,154 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-01-18 18:05:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-18 18:05:43,154 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-01-18 18:05:43,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:43,155 INFO L225 Difference]: With dead ends: 322 [2019-01-18 18:05:43,155 INFO L226 Difference]: Without dead ends: 215 [2019-01-18 18:05:43,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 18:05:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-18 18:05:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-01-18 18:05:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-18 18:05:43,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-01-18 18:05:43,160 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-01-18 18:05:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:43,160 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-01-18 18:05:43,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 18:05:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-01-18 18:05:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-18 18:05:43,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:43,161 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-01-18 18:05:43,161 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:43,161 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-01-18 18:05:43,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:43,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:43,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:43,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:43,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:43,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-01-18 18:05:47,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:47,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:47,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:47,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:47,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:47,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:47,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:05:47,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:05:47,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:05:47,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:47,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:47,648 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 5565 trivial. 0 not checked. [2019-01-18 18:05:47,649 INFO L316 TraceCheckSpWp]: Computing backward predicates...