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/count_by_nondet.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:56:13,752 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:56:13,755 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:56:13,767 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:56:13,767 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:56:13,768 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:56:13,769 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:56:13,771 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:56:13,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:56:13,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:56:13,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:56:13,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:56:13,777 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:56:13,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:56:13,779 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:56:13,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:56:13,781 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:56:13,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:56:13,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:56:13,787 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:56:13,788 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:56:13,790 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:56:13,792 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:56:13,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:56:13,793 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:56:13,794 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:56:13,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:56:13,796 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:56:13,797 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:56:13,798 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:56:13,798 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:56:13,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:56:13,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:56:13,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:56:13,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:56:13,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:56:13,802 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 18:56:13,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:56:13,820 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:56:13,821 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:56:13,823 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:56:13,823 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:56:13,824 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:56:13,824 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:56:13,824 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:56:13,824 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:56:13,824 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 18:56:13,825 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:56:13,826 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:56:13,826 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:56:13,826 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:56:13,827 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:56:13,827 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:56:13,827 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:56:13,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:56:13,829 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:56:13,830 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:56:13,830 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:56:13,830 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:56:13,830 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:56:13,830 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:56:13,830 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:56:13,831 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:56:13,831 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:56:13,831 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:56:13,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:56:13,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:56:13,832 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:56:13,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:56:13,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:56:13,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:56:13,834 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:56:13,834 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:56:13,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:56:13,834 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:56:13,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:56:13,835 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:56:13,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:56:13,895 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:56:13,905 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:56:13,906 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:56:13,907 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:56:13,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl [2018-12-03 18:56:13,908 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl' [2018-12-03 18:56:13,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:56:13,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:56:13,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:56:13,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:56:13,956 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:56:13,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:13,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:13,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:56:13,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:56:13,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:56:13,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:56:14,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:14,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:14,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:14,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:14,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:14,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:14,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... [2018-12-03 18:56:14,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:56:14,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:56:14,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:56:14,024 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:56:14,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:56:14,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 18:56:14,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 18:56:14,342 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 18:56:14,343 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:56:14,343 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:56:14 BoogieIcfgContainer [2018-12-03 18:56:14,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:56:14,344 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:56:14,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:56:14,349 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:56:14,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:56:13" (1/2) ... [2018-12-03 18:56:14,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f23cc76 and model type count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:56:14, skipping insertion in model container [2018-12-03 18:56:14,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:56:14" (2/2) ... [2018-12-03 18:56:14,354 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i_3.bpl [2018-12-03 18:56:14,365 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:56:14,374 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:56:14,389 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:56:14,420 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:56:14,420 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:56:14,420 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:56:14,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:56:14,421 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:56:14,421 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:56:14,422 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:56:14,422 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:56:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:56:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:56:14,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:14,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:56:14,445 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:14,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:14,451 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 18:56:14,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:14,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:14,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:14,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:14,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:14,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:56:14,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:56:14,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:56:14,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:56:14,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:56:14,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:56:14,616 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:56:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:14,669 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 18:56:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:56:14,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:56:14,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:14,684 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:56:14,685 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:56:14,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:56:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:56:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:56:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:56:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:56:14,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:56:14,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:14,729 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:56:14,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:56:14,729 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:56:14,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:56:14,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:14,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:56:14,730 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:14,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:14,731 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 18:56:14,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:14,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:14,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:14,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:14,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:14,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:14,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:14,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:14,882 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:56:14,884 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 18:56:14,942 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:56:14,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:56:15,391 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:56:15,395 INFO L272 AbstractInterpreter]: Visited 4 different actions 30 times. Merged at 3 different actions 19 times. Widened at 1 different actions 7 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 18:56:15,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:15,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:56:15,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:15,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:15,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:15,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:15,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:15,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:15,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:15,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2018-12-03 18:56:15,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:15,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:56:15,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:56:15,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:56:15,588 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 18:56:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:15,610 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:56:15,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:56:15,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 18:56:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:15,611 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:56:15,611 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:56:15,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 18:56:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:56:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:56:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:56:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:56:15,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:56:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:15,616 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:56:15,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:56:15,616 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:56:15,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:56:15,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:15,617 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:56:15,617 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:15,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:15,618 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 18:56:15,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:15,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:15,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:15,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:15,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:15,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:15,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:15,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:15,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:15,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:15,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:15,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:15,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:56:15,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:15,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:15,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:15,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:15,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 18:56:15,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:15,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:56:15,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:56:15,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:56:15,911 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 18:56:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:15,955 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:56:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:56:15,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 18:56:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:15,956 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:56:15,957 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:56:15,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:56:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:56:15,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:56:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:56:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:56:15,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:56:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:15,961 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:56:15,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:56:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:56:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:56:15,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:15,962 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 18:56:15,962 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:15,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:15,963 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 18:56:15,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:15,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:15,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:15,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:15,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:16,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:16,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:16,148 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:16,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:16,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:16,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:16,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:16,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:16,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:16,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:16,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:16,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:16,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:16,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 18:56:16,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:16,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:56:16,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:56:16,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:56:16,424 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 18:56:16,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:16,446 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:56:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:56:16,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 18:56:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:16,448 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:56:16,448 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:56:16,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:56:16,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:56:16,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:56:16,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:56:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:56:16,452 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 18:56:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:16,452 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:56:16,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:56:16,453 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:56:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:56:16,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:16,453 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 18:56:16,454 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:16,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 18:56:16,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:16,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:16,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:16,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:16,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:16,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:16,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:16,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:16,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:16,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:16,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:16,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:16,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:16,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:16,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:16,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:16,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 18:56:16,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:16,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:56:16,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:56:16,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:56:16,809 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 18:56:16,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:16,836 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 18:56:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:56:16,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 18:56:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:16,837 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:56:16,838 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:56:16,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:56:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:56:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:56:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:56:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:56:16,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 18:56:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:16,842 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:56:16,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:56:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:56:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:56:16,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:16,843 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 18:56:16,843 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:16,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:16,844 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 18:56:16,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:16,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:16,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:16,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:16,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:16,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:16,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:16,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:16,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:16,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:16,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:16,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:16,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:56:16,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:16,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:16,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:16,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:17,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:17,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 18:56:17,611 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:17,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:56:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:56:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:56:17,612 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 18:56:17,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:17,640 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:56:17,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:56:17,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 18:56:17,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:17,642 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:56:17,642 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:56:17,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:56:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:56:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:56:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:56:17,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:56:17,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 18:56:17,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:17,646 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:56:17,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:56:17,646 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:56:17,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:56:17,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:17,647 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 18:56:17,647 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:17,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 18:56:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:17,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:17,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:17,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:17,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:17,873 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:17,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:17,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:17,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:17,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:17,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:17,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:17,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:17,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:17,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:18,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:18,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 18:56:18,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:18,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:56:18,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:56:18,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:56:18,225 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 18:56:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:18,247 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 18:56:18,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:56:18,248 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 18:56:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:18,249 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:56:18,250 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:56:18,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:56:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:56:18,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:56:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:56:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 18:56:18,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 18:56:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:18,255 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 18:56:18,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:56:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 18:56:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:56:18,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:18,256 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 18:56:18,256 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:18,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:18,256 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 18:56:18,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:18,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:18,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:18,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:18,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:18,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:18,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:18,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:18,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:18,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:18,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:18,468 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:18,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:18,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:18,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:18,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 18:56:18,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:18,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:56:18,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:56:18,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:56:18,762 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 18:56:18,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:18,786 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:56:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:56:18,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 18:56:18,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:18,790 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:56:18,790 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 18:56:18,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:56:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 18:56:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 18:56:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:56:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 18:56:18,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 18:56:18,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:18,794 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 18:56:18,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:56:18,794 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 18:56:18,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:56:18,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:18,794 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 18:56:18,795 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:18,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 18:56:18,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:18,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:18,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:18,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:19,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:19,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:19,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:19,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:19,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:19,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:19,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:19,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:19,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 18:56:19,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:19,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:19,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:19,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:19,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 18:56:19,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:19,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:56:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:56:19,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:56:19,317 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 18:56:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:19,415 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 18:56:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:56:19,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 18:56:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:19,418 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:56:19,419 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:56:19,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:56:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:56:19,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:56:19,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:56:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:56:19,422 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 18:56:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:19,422 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:56:19,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:56:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:56:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:56:19,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:19,423 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 18:56:19,423 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:19,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:19,423 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 18:56:19,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:19,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:19,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:19,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:19,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:19,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:19,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:19,557 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:19,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:19,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:19,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:19,569 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:19,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:19,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:19,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:19,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:19,616 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:19,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:19,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:19,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 18:56:19,851 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:19,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:56:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:56:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:56:19,853 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 18:56:19,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:19,879 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 18:56:19,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:56:19,879 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 18:56:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:19,880 INFO L225 Difference]: With dead ends: 16 [2018-12-03 18:56:19,881 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 18:56:19,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:56:19,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 18:56:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 18:56:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:56:19,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 18:56:19,885 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 18:56:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:19,885 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 18:56:19,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:56:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 18:56:19,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:56:19,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:19,886 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 18:56:19,886 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:19,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 18:56:19,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:19,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:19,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:19,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:19,887 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:20,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:20,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:20,089 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:20,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:20,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:20,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:20,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:20,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:20,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:20,124 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:20,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:20,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:20,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 18:56:20,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:20,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:56:20,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:56:20,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:56:20,487 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 18:56:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:20,524 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 18:56:20,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:56:20,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 18:56:20,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:20,525 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:56:20,525 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:56:20,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:56:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:56:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 18:56:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 18:56:20,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 18:56:20,531 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 18:56:20,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:20,531 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 18:56:20,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:56:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 18:56:20,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:56:20,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:20,532 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 18:56:20,532 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:20,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 18:56:20,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:20,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:20,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:20,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:20,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:20,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:20,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:20,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:20,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:20,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:20,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:20,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:20,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 18:56:20,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:20,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:20,875 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:20,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:21,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:21,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 18:56:21,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:21,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:56:21,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:56:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:56:21,576 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 18:56:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:21,613 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 18:56:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:56:21,616 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 18:56:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:21,616 INFO L225 Difference]: With dead ends: 18 [2018-12-03 18:56:21,616 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:56:21,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:56:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:56:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 18:56:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:56:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 18:56:21,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 18:56:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:21,620 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 18:56:21,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:56:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 18:56:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:56:21,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:21,621 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 18:56:21,621 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:21,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:21,622 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 18:56:21,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:21,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:21,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:21,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:21,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:21,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:21,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:21,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:21,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:21,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:21,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:21,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:21,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:21,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:21,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:21,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:21,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:21,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:22,549 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:22,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:22,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 18:56:22,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:22,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:56:22,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:56:22,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:56:22,572 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 18:56:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:22,747 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 18:56:22,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:56:22,748 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 18:56:22,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:22,749 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:56:22,749 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:56:22,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:56:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:56:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 18:56:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:56:22,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 18:56:22,753 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 18:56:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:22,753 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 18:56:22,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:56:22,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 18:56:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:56:22,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:22,754 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 18:56:22,755 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:22,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 18:56:22,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:22,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:22,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:22,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:22,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:23,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:23,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:23,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:23,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:23,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:23,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:23,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:23,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:23,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:23,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:23,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:23,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 18:56:23,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:23,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:56:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:56:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:56:23,617 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 18:56:23,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:23,653 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 18:56:23,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:56:23,654 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 18:56:23,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:23,655 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:56:23,655 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:56:23,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:56:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:56:23,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:56:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:56:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 18:56:23,660 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 18:56:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:23,661 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 18:56:23,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:56:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 18:56:23,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:56:23,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:23,661 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 18:56:23,661 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:23,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 18:56:23,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:23,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:23,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:23,993 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:23,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:23,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:23,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:23,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:23,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:23,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:24,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:24,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:24,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 18:56:24,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:24,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:24,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:24,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:24,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 18:56:24,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:24,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:56:24,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:56:24,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:56:24,601 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 18:56:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:24,632 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 18:56:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:56:24,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 18:56:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:24,636 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:56:24,636 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:56:24,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:56:24,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:56:24,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 18:56:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:56:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 18:56:24,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 18:56:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:24,641 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 18:56:24,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:56:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 18:56:24,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:56:24,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:24,642 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 18:56:24,642 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:24,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:24,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 18:56:24,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:24,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:24,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:24,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:24,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:25,440 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:25,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:25,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:25,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:25,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:25,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:25,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:25,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:25,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:25,483 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:25,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:25,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:25,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:25,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:25,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 18:56:25,900 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:25,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:56:25,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:56:25,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:56:25,901 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 18:56:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:25,929 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 18:56:25,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:56:25,930 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 18:56:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:25,931 INFO L225 Difference]: With dead ends: 22 [2018-12-03 18:56:25,931 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:56:25,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:56:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:56:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:56:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:56:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 18:56:25,936 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 18:56:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:25,936 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 18:56:25,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:56:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 18:56:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:56:25,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:25,937 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 18:56:25,937 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:25,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 18:56:25,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:25,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:25,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:25,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:25,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:26,561 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:26,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:26,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:26,561 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:26,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:26,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:26,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:26,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:26,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:26,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:26,618 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:26,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:27,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:27,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 18:56:27,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:27,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:56:27,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:56:27,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:56:27,626 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 18:56:27,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:27,660 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 18:56:27,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:56:27,661 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 18:56:27,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:27,661 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:56:27,661 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:56:27,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:56:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:56:27,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:56:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:56:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 18:56:27,665 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 18:56:27,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:27,665 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 18:56:27,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:56:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 18:56:27,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:56:27,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:27,666 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 18:56:27,666 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:27,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 18:56:27,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:27,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:27,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:27,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:27,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:27,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:27,953 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:27,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:27,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:27,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:27,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:27,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:28,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:56:28,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:28,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:28,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:28,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:28,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 18:56:28,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:28,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:56:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:56:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:56:28,996 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 18:56:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:29,031 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 18:56:29,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:56:29,031 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 18:56:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:29,032 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:56:29,032 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:56:29,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:56:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:56:29,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:56:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:56:29,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 18:56:29,037 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 18:56:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:29,038 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 18:56:29,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:56:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 18:56:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:56:29,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:29,039 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 18:56:29,039 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:29,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:29,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 18:56:29,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:29,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:29,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:29,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:29,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:29,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:29,355 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:29,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:29,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:29,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:29,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:29,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:29,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:29,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:29,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:29,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:29,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:29,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 18:56:29,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:29,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:56:29,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:56:29,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:56:29,925 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 18:56:30,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:30,022 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 18:56:30,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:56:30,024 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 18:56:30,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:30,025 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:56:30,025 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:56:30,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:56:30,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:56:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 18:56:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 18:56:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 18:56:30,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 18:56:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:30,029 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 18:56:30,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:56:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 18:56:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:56:30,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:30,030 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 18:56:30,030 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:30,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:30,031 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 18:56:30,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:30,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:30,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:30,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:30,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:30,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:30,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:30,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:30,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:30,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:30,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:30,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:30,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:31,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:31,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:31,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:31,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 18:56:31,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:31,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:56:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:56:31,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:56:31,870 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 18:56:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:31,925 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 18:56:31,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:56:31,925 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 18:56:31,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:31,926 INFO L225 Difference]: With dead ends: 26 [2018-12-03 18:56:31,926 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:56:31,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:56:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:56:31,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:56:31,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:56:31,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 18:56:31,931 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 18:56:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:31,931 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 18:56:31,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:56:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 18:56:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:56:31,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:31,932 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 18:56:31,932 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:31,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:31,933 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 18:56:31,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:31,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:31,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:32,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:32,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:32,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:32,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:32,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:32,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:32,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:32,189 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:32,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 18:56:32,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:32,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:32,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:32,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:32,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 18:56:32,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:32,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:56:32,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:56:32,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:56:32,985 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 18:56:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:33,031 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 18:56:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:56:33,031 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 18:56:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:33,032 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:56:33,032 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:56:33,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:56:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:56:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 18:56:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:56:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 18:56:33,036 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 18:56:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:33,036 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 18:56:33,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:56:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 18:56:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:56:33,037 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:33,037 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 18:56:33,038 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:33,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 18:56:33,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:33,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:33,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:33,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:33,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:33,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:33,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:33,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:33,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:33,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:33,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:33,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:33,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:33,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:33,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:34,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:34,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 18:56:34,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:34,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:56:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:56:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:56:34,143 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 18:56:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:34,254 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 18:56:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:56:34,257 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 18:56:34,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:34,257 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:56:34,257 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:56:34,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:56:34,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:56:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:56:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:56:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 18:56:34,261 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 18:56:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:34,261 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 18:56:34,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:56:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 18:56:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:56:34,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:34,262 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 18:56:34,262 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:34,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:34,263 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 18:56:34,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:34,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:34,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:34,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:34,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:34,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:34,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:34,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:34,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:34,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:34,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:34,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:34,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:35,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:35,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 18:56:35,269 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:35,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:56:35,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:56:35,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:56:35,271 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 18:56:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:35,303 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 18:56:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:56:35,304 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 18:56:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:35,305 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:56:35,305 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:56:35,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:56:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:56:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 18:56:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 18:56:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 18:56:35,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 18:56:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:35,310 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 18:56:35,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:56:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 18:56:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:56:35,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:35,311 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 18:56:35,311 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:35,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 18:56:35,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:35,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:35,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:36,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:36,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:36,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:36,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:36,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:36,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:36,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:36,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:36,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 18:56:36,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:36,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:36,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:37,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:37,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 18:56:37,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:37,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 18:56:37,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 18:56:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:56:37,503 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 18:56:37,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:37,554 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 18:56:37,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:56:37,555 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 18:56:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:37,555 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:56:37,555 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:56:37,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:56:37,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:56:37,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:56:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:56:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 18:56:37,560 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 18:56:37,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:37,560 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 18:56:37,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 18:56:37,560 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 18:56:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:56:37,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:37,561 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 18:56:37,561 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:37,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:37,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 18:56:37,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:37,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:37,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:37,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:37,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:38,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:38,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:38,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:38,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:38,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:38,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:38,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:38,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:38,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:38,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:38,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:38,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:39,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:39,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 18:56:39,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:39,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:56:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:56:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:56:39,932 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 18:56:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:39,985 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 18:56:39,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:56:39,985 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 18:56:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:39,986 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:56:39,986 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:56:39,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:56:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:56:39,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 18:56:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:56:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 18:56:39,992 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 18:56:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:39,992 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 18:56:39,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:56:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 18:56:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:56:39,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:39,993 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 18:56:39,993 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:39,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 18:56:39,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:39,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:39,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:39,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:39,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:40,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:40,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:40,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:40,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:40,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:40,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:40,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:40,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:40,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:40,471 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:40,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:41,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:41,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 18:56:41,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:41,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:56:41,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:56:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:56:41,362 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 18:56:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:41,400 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 18:56:41,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:56:41,400 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 18:56:41,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:41,401 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:56:41,401 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:56:41,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:56:41,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:56:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:56:41,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:56:41,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 18:56:41,405 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 18:56:41,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:41,406 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 18:56:41,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:56:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 18:56:41,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 18:56:41,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:41,406 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 18:56:41,407 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:41,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:41,407 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 18:56:41,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:41,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:41,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:41,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:41,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:42,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:42,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:42,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:42,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:42,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:42,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:42,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:42,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:42,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 18:56:42,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:42,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:42,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:43,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 18:56:43,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:43,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:56:43,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:56:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:56:43,414 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 18:56:43,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:43,642 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 18:56:43,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:56:43,642 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 18:56:43,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:43,643 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:56:43,643 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:56:43,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:56:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:56:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:56:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:56:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 18:56:43,648 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 18:56:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:43,648 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 18:56:43,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:56:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 18:56:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:56:43,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:43,649 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 18:56:43,649 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:43,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 18:56:43,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:43,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:43,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:43,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:44,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:44,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:44,269 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:44,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:44,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:44,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:44,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:44,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:44,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:44,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:44,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:44,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:45,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:45,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 18:56:45,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:45,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:56:45,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:56:45,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:56:45,215 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 18:56:45,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:45,261 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 18:56:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:56:45,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 18:56:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:45,262 INFO L225 Difference]: With dead ends: 34 [2018-12-03 18:56:45,262 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 18:56:45,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:56:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 18:56:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 18:56:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:56:45,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 18:56:45,269 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 18:56:45,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:45,269 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 18:56:45,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:56:45,269 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 18:56:45,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:56:45,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:45,270 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 18:56:45,270 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:45,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:45,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 18:56:45,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:45,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:45,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:45,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:45,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:45,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:45,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:45,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:45,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:45,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:45,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:45,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:45,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:45,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:46,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:46,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 18:56:46,973 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:46,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:56:46,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:56:46,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:56:46,974 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 18:56:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:47,102 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 18:56:47,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:56:47,103 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 18:56:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:47,103 INFO L225 Difference]: With dead ends: 35 [2018-12-03 18:56:47,103 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:56:47,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:56:47,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:56:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 18:56:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:56:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 18:56:47,107 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 18:56:47,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:47,107 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 18:56:47,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:56:47,107 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 18:56:47,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 18:56:47,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:47,108 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 18:56:47,108 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:47,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:47,108 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 18:56:47,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:47,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:47,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:47,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:47,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:47,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:47,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:47,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:47,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:47,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:47,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:47,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:47,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 18:56:47,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:47,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:47,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:48,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:48,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 18:56:48,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:48,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:56:48,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:56:48,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:56:48,924 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 18:56:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:48,976 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 18:56:48,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:56:48,976 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 18:56:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:48,977 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:56:48,977 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:56:48,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:56:48,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:56:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 18:56:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:56:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 18:56:48,981 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 18:56:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:48,982 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 18:56:48,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:56:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 18:56:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:56:48,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:48,982 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 18:56:48,982 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:48,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 18:56:48,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:48,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:48,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:48,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:48,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:50,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:50,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:50,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:50,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:50,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:50,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:50,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:50,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:50,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:50,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:50,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:50,123 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:50,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:51,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 18:56:51,237 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:51,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:56:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:56:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:56:51,238 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 18:56:51,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:51,344 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 18:56:51,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:56:51,345 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 18:56:51,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:51,345 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:56:51,346 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:56:51,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:56:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:56:51,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 18:56:51,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 18:56:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 18:56:51,349 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 18:56:51,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:51,349 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 18:56:51,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:56:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 18:56:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:56:51,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:51,350 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 18:56:51,350 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:51,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 18:56:51,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:51,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:51,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:51,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:52,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:52,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:52,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:52,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:52,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:52,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:52,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:52,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:52,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:52,110 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:52,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:53,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:53,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 18:56:53,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:53,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:56:53,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:56:53,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:56:53,660 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 18:56:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:53,733 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 18:56:53,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:56:53,734 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 18:56:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:53,734 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:56:53,734 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:56:53,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:56:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:56:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:56:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:56:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 18:56:53,739 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 18:56:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:53,740 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 18:56:53,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:56:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 18:56:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:56:53,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:53,741 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 18:56:53,741 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:53,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 18:56:53,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:53,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:53,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:54,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:54,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:54,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:54,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:54,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:54,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:54,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:56:54,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:56:54,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 18:56:54,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:54,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:54,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:55,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:55,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 18:56:55,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:55,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:56:55,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:56:55,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:56:55,661 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 18:56:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:55,745 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 18:56:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:56:55,745 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 18:56:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:55,746 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:56:55,746 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:56:55,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:56:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:56:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:56:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:56:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 18:56:55,750 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 18:56:55,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:55,750 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 18:56:55,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:56:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 18:56:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 18:56:55,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:55,751 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 18:56:55,751 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:55,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-03 18:56:55,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:55,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:55,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:56,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:56,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:56,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:56,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:56,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:56,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:56,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:56:56,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:56:56,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:56:56,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:56:56,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:56,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:56:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:57,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:56:57,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 18:56:57,873 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:56:57,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:56:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:56:57,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:56:57,875 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 18:56:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:56:57,993 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 18:56:57,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:56:57,993 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 18:56:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:56:57,993 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:56:57,994 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:56:57,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:56:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:56:57,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 18:56:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:56:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 18:56:57,997 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 18:56:57,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:56:57,997 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 18:56:57,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:56:57,997 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 18:56:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:56:57,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:56:57,998 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 18:56:57,998 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:56:57,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:56:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-03 18:56:57,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:56:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:57,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:56:57,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:56:57,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:56:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:58,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:58,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:56:58,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:56:58,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:56:58,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:56:58,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:56:58,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:56:58,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:56:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:56:58,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:56:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:56:58,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:00,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:00,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 18:57:00,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:00,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:57:00,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:57:00,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:57:00,207 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 18:57:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:00,256 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 18:57:00,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:57:00,257 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 18:57:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:00,258 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:57:00,258 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:57:00,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:57:00,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:57:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 18:57:00,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 18:57:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 18:57:00,261 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 18:57:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:00,262 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 18:57:00,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:57:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 18:57:00,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:57:00,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:00,263 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 18:57:00,263 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:00,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:00,264 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-03 18:57:00,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:00,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:00,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:00,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:00,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:00,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:00,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:00,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:00,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:00,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:00,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:00,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:57:00,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:57:00,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 18:57:00,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:00,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:01,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:02,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:02,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 18:57:02,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:02,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 18:57:02,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 18:57:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:57:02,718 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 18:57:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:02,765 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 18:57:02,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:57:02,765 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 18:57:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:02,766 INFO L225 Difference]: With dead ends: 42 [2018-12-03 18:57:02,766 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 18:57:02,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:57:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 18:57:02,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 18:57:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:57:02,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 18:57:02,770 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 18:57:02,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:02,770 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 18:57:02,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 18:57:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 18:57:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:57:02,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:02,771 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 18:57:02,771 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:02,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:02,771 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-03 18:57:02,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:02,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:02,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:02,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:02,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:03,502 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:03,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:03,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:03,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:03,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:03,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:03,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:03,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:57:03,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:57:03,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:57:03,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:03,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:03,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:05,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:05,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 18:57:05,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:05,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:57:05,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:57:05,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:57:05,554 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 18:57:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:05,616 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 18:57:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:57:05,617 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 18:57:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:05,617 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:57:05,618 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:57:05,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:57:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:57:05,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 18:57:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:57:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 18:57:05,620 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 18:57:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:05,620 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 18:57:05,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:57:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 18:57:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 18:57:05,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:05,621 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 18:57:05,621 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:05,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:05,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-03 18:57:05,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:05,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:05,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:05,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:05,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:06,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:06,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:06,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:06,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:06,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:06,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:06,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:06,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:57:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:06,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:06,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:08,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:08,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 18:57:08,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:08,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:57:08,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:57:08,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:57:08,455 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 18:57:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:08,520 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 18:57:08,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:57:08,520 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 18:57:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:08,521 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:57:08,521 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:57:08,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:57:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:57:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 18:57:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:57:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 18:57:08,524 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 18:57:08,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:08,524 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 18:57:08,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:57:08,525 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 18:57:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:57:08,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:08,525 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 18:57:08,525 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:08,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:08,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-03 18:57:08,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:08,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:08,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:08,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:08,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:09,237 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:09,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:09,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:09,238 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:09,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:09,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:09,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:09,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:57:09,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:57:09,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 18:57:09,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:09,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:09,475 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:09,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:11,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:11,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 18:57:11,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:11,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:57:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:57:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:57:11,351 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 18:57:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:11,401 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 18:57:11,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:57:11,401 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 18:57:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:11,402 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:57:11,402 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:57:11,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:57:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:57:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 18:57:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:57:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 18:57:11,405 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 18:57:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:11,406 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 18:57:11,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:57:11,406 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 18:57:11,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 18:57:11,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:11,406 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 18:57:11,406 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:11,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:11,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-03 18:57:11,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:11,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:11,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:11,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:12,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:12,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:12,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:12,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:12,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:12,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:12,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:57:12,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:57:12,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:57:12,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:12,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:12,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:14,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:14,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 18:57:14,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:14,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:57:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:57:14,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:57:14,375 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 18:57:14,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:14,468 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 18:57:14,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:57:14,469 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 18:57:14,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:14,469 INFO L225 Difference]: With dead ends: 46 [2018-12-03 18:57:14,470 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:57:14,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:57:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:57:14,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:57:14,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:57:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 18:57:14,473 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 18:57:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:14,473 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 18:57:14,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:57:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 18:57:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:57:14,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:14,474 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 18:57:14,474 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:14,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-03 18:57:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:14,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:14,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:14,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:14,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:15,278 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:15,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:15,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:15,279 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:15,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:15,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:15,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:15,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:15,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:57:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:15,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:15,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:17,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:17,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 18:57:17,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:17,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:57:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:57:17,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:57:17,250 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 18:57:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:17,351 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 18:57:17,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:57:17,351 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 18:57:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:17,352 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:57:17,352 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 18:57:17,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:57:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 18:57:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 18:57:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 18:57:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 18:57:17,355 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 18:57:17,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:17,355 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 18:57:17,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:57:17,355 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 18:57:17,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:57:17,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:17,356 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 18:57:17,356 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:17,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-03 18:57:17,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:17,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:17,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:17,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:18,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:18,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:18,247 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:18,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:18,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:18,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:18,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:57:18,256 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:57:18,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 18:57:18,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:18,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:18,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:20,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:20,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 18:57:20,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:20,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:57:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:57:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:57:20,373 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 18:57:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:20,444 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 18:57:20,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:57:20,444 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 18:57:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:20,445 INFO L225 Difference]: With dead ends: 48 [2018-12-03 18:57:20,445 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 18:57:20,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:57:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 18:57:20,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 18:57:20,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 18:57:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 18:57:20,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 18:57:20,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:20,449 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 18:57:20,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:57:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 18:57:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 18:57:20,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:20,449 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 18:57:20,449 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:20,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-03 18:57:20,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:20,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:20,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:21,400 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:21,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:21,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:21,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:21,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:21,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:21,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:21,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:57:21,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:57:21,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:57:21,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:21,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:21,490 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:21,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:23,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:23,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 18:57:23,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:23,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:57:23,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:57:23,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:57:23,827 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 18:57:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:23,887 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 18:57:23,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:57:23,887 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 18:57:23,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:23,887 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:57:23,887 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:57:23,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:57:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:57:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 18:57:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 18:57:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 18:57:23,890 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 18:57:23,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:23,890 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 18:57:23,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:57:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 18:57:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 18:57:23,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:23,891 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 18:57:23,891 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:23,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-03 18:57:23,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:23,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:23,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:23,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:24,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:24,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:24,691 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:24,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:24,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:24,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:24,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:24,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:57:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:24,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:24,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:26,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:26,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 18:57:26,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:26,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 18:57:26,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 18:57:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:57:26,899 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 18:57:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:27,039 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 18:57:27,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:57:27,040 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 18:57:27,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:27,041 INFO L225 Difference]: With dead ends: 50 [2018-12-03 18:57:27,041 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 18:57:27,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:57:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 18:57:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 18:57:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 18:57:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 18:57:27,044 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 18:57:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:27,044 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 18:57:27,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 18:57:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 18:57:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:57:27,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:27,045 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 18:57:27,045 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:27,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-03 18:57:27,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:27,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:27,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:27,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:27,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:28,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:28,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:28,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:28,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:28,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:28,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:28,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:57:28,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:57:28,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 18:57:28,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:28,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:28,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:30,476 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:30,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:30,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 18:57:30,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:30,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:57:30,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:57:30,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:57:30,496 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 18:57:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:30,551 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 18:57:30,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:57:30,551 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 18:57:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:30,552 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:57:30,552 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 18:57:30,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:57:30,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 18:57:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 18:57:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 18:57:30,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 18:57:30,556 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 18:57:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:30,556 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 18:57:30,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:57:30,557 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 18:57:30,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 18:57:30,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:30,557 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 18:57:30,557 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:30,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:30,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-03 18:57:30,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:30,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:30,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:30,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:31,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:31,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:31,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:31,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:31,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:31,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:31,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:31,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:57:31,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:57:31,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:57:31,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:31,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:31,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:34,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:34,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:34,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 18:57:34,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:34,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:57:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:57:34,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:57:34,341 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 18:57:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:34,691 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 18:57:34,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:57:34,691 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 18:57:34,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:34,692 INFO L225 Difference]: With dead ends: 52 [2018-12-03 18:57:34,692 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 18:57:34,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:57:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 18:57:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 18:57:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:57:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 18:57:34,694 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 18:57:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:34,695 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 18:57:34,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:57:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 18:57:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:57:34,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:34,695 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 18:57:34,695 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:34,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:34,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-03 18:57:34,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:34,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:34,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:34,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:34,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:35,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:35,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:35,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:35,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:35,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:35,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:35,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:35,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:57:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:35,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:35,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:35,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:38,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:38,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 18:57:38,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:38,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:57:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:57:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:57:38,695 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 18:57:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:38,787 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 18:57:38,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:57:38,787 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 18:57:38,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:38,788 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:57:38,789 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:57:38,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:57:38,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:57:38,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 18:57:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:57:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 18:57:38,792 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 18:57:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:38,792 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 18:57:38,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:57:38,792 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 18:57:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:57:38,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:38,793 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 18:57:38,793 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:38,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-03 18:57:38,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:38,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:38,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:38,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:38,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:39,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:39,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:39,723 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:39,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:39,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:39,723 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:39,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:57:39,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:57:39,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 18:57:39,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:39,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:39,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:42,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:42,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 18:57:42,638 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:42,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 18:57:42,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 18:57:42,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:57:42,640 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 18:57:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:42,697 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 18:57:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:57:42,697 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 18:57:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:42,698 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:57:42,698 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:57:42,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:57:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:57:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 18:57:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:57:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 18:57:42,702 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 18:57:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:42,702 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 18:57:42,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 18:57:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 18:57:42,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:57:42,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:42,703 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 18:57:42,703 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:42,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:42,704 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-03 18:57:42,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:42,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:42,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:42,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:44,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:44,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:44,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:44,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:44,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:44,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:44,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:57:44,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:57:44,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:57:44,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:44,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:44,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:46,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:46,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 18:57:46,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:46,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:57:46,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:57:46,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:57:46,933 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 18:57:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:47,095 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 18:57:47,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:57:47,096 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 18:57:47,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:47,096 INFO L225 Difference]: With dead ends: 55 [2018-12-03 18:57:47,096 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:57:47,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:57:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:57:47,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:57:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:57:47,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 18:57:47,100 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 18:57:47,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:47,100 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 18:57:47,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:57:47,100 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 18:57:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:57:47,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:47,100 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 18:57:47,101 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:47,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-03 18:57:47,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:47,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:47,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:47,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:47,102 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:48,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:48,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:48,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:48,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:48,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:48,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:48,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:48,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:57:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:48,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:48,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:48,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:51,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:51,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 18:57:51,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:51,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:57:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:57:51,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:57:51,242 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 18:57:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:51,301 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 18:57:51,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:57:51,301 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 18:57:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:51,302 INFO L225 Difference]: With dead ends: 56 [2018-12-03 18:57:51,302 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 18:57:51,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:57:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 18:57:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 18:57:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:57:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 18:57:51,306 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 18:57:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:51,306 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 18:57:51,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:57:51,307 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 18:57:51,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 18:57:51,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:51,307 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 18:57:51,307 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:51,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:51,308 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-03 18:57:51,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:51,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:57:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:51,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:52,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:52,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:52,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:52,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:52,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:52,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:52,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:57:52,388 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:57:52,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 18:57:52,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:52,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:52,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:57:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:55,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:57:55,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 18:57:55,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:57:55,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 18:57:55,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 18:57:55,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 18:57:55,556 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 18:57:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:57:55,739 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 18:57:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 18:57:55,739 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 18:57:55,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:57:55,740 INFO L225 Difference]: With dead ends: 57 [2018-12-03 18:57:55,741 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 18:57:55,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 18:57:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 18:57:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 18:57:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 18:57:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 18:57:55,744 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 18:57:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:57:55,744 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 18:57:55,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 18:57:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 18:57:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 18:57:55,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:57:55,745 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 18:57:55,745 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:57:55,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:57:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-03 18:57:55,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:57:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:55,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:57:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:57:55,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:57:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:57:57,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:57,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:57,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:57:57,059 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:57:57,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:57:57,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:57:57,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:57:57,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:57:57,070 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:57:57,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:57:57,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:57:57,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:57:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:57:57,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:00,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:00,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 18:58:00,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:00,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 18:58:00,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 18:58:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:58:00,429 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 18:58:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:00,521 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 18:58:00,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 18:58:00,522 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 18:58:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:00,522 INFO L225 Difference]: With dead ends: 58 [2018-12-03 18:58:00,522 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 18:58:00,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 18:58:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 18:58:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 18:58:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 18:58:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 18:58:00,525 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 18:58:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:00,526 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 18:58:00,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 18:58:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 18:58:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 18:58:00,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:00,526 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 18:58:00,527 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:00,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-03 18:58:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:00,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:00,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:01,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:01,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:01,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:01,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:01,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:01,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:01,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:01,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:01,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:58:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:01,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:01,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:04,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:04,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 18:58:04,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:04,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 18:58:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 18:58:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 18:58:04,968 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 18:58:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:05,057 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 18:58:05,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 18:58:05,058 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 18:58:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:05,059 INFO L225 Difference]: With dead ends: 59 [2018-12-03 18:58:05,059 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 18:58:05,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 18:58:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 18:58:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 18:58:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 18:58:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 18:58:05,062 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 18:58:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:05,062 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 18:58:05,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 18:58:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 18:58:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 18:58:05,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:05,063 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 18:58:05,063 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:05,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:05,064 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-03 18:58:05,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:05,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:05,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:05,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:05,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:06,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:06,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:06,460 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:06,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:06,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:06,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:06,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:58:06,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:58:06,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 18:58:06,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:06,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:06,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:09,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:09,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 18:58:09,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:09,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 18:58:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 18:58:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 18:58:09,937 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 18:58:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:10,006 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 18:58:10,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 18:58:10,006 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 18:58:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:10,007 INFO L225 Difference]: With dead ends: 60 [2018-12-03 18:58:10,007 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 18:58:10,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 18:58:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 18:58:10,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 18:58:10,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 18:58:10,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 18:58:10,011 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 18:58:10,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:10,011 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 18:58:10,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 18:58:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 18:58:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 18:58:10,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:10,012 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 18:58:10,012 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:10,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:10,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-03 18:58:10,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:10,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:10,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:10,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:10,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:12,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:12,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:12,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:12,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:12,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:12,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:12,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:58:12,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:58:12,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:58:12,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:12,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:12,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:15,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:15,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 18:58:15,673 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:15,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 18:58:15,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 18:58:15,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:58:15,675 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 18:58:15,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:15,765 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 18:58:15,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 18:58:15,766 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 18:58:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:15,766 INFO L225 Difference]: With dead ends: 61 [2018-12-03 18:58:15,767 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 18:58:15,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 18:58:15,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 18:58:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 18:58:15,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 18:58:15,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 18:58:15,769 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 18:58:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:15,769 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 18:58:15,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 18:58:15,770 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 18:58:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 18:58:15,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:15,770 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 18:58:15,770 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:15,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-03 18:58:15,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:15,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:15,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:15,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:15,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:17,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:17,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:17,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:17,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:17,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:17,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:17,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:17,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:58:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:17,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:17,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:21,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:21,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 18:58:21,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:21,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 18:58:21,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 18:58:21,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 18:58:21,556 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 18:58:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:21,683 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 18:58:21,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 18:58:21,683 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 18:58:21,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:21,684 INFO L225 Difference]: With dead ends: 62 [2018-12-03 18:58:21,684 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 18:58:21,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 18:58:21,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 18:58:21,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 18:58:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 18:58:21,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 18:58:21,688 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 18:58:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:21,688 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 18:58:21,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 18:58:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 18:58:21,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 18:58:21,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:21,689 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 18:58:21,689 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:21,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-03 18:58:21,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:21,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:21,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:21,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:21,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:22,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:22,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:22,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:22,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:22,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:22,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:22,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:58:22,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:58:23,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 18:58:23,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:23,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:23,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:26,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:26,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:26,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 18:58:26,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:26,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 18:58:26,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 18:58:26,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 18:58:26,824 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 18:58:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:26,896 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 18:58:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 18:58:26,896 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 18:58:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:26,897 INFO L225 Difference]: With dead ends: 63 [2018-12-03 18:58:26,897 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 18:58:26,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 18:58:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 18:58:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 18:58:26,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 18:58:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 18:58:26,902 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 18:58:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:26,902 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 18:58:26,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 18:58:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 18:58:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 18:58:26,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:26,903 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 18:58:26,903 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:26,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-03 18:58:26,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:26,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:26,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:28,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:28,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:28,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:28,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:28,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:28,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:28,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:58:28,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:58:28,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:58:28,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:28,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:28,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:32,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:32,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 18:58:32,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:32,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 18:58:32,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 18:58:32,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:58:32,777 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 18:58:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:32,878 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 18:58:32,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 18:58:32,879 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 18:58:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:32,879 INFO L225 Difference]: With dead ends: 64 [2018-12-03 18:58:32,879 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 18:58:32,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 18:58:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 18:58:32,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 18:58:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 18:58:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 18:58:32,883 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 18:58:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:32,883 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 18:58:32,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 18:58:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 18:58:32,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 18:58:32,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:32,884 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 18:58:32,884 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:32,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:32,884 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-03 18:58:32,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:32,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:32,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:32,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:34,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:34,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:34,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:34,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:34,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:34,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:34,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:34,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:58:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:34,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:34,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:38,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:38,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:38,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 18:58:38,317 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:38,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 18:58:38,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 18:58:38,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 18:58:38,319 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 18:58:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:38,405 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 18:58:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 18:58:38,406 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 18:58:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:38,406 INFO L225 Difference]: With dead ends: 65 [2018-12-03 18:58:38,407 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 18:58:38,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 18:58:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 18:58:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 18:58:38,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 18:58:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 18:58:38,411 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 18:58:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:38,411 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 18:58:38,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 18:58:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 18:58:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 18:58:38,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:38,411 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 18:58:38,412 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:38,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-03 18:58:38,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:38,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:38,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:38,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:38,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:40,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:40,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:40,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:40,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:40,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:40,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:40,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:58:40,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:58:40,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 18:58:40,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:40,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:40,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:44,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:44,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 18:58:44,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:44,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 18:58:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 18:58:44,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 18:58:44,017 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 18:58:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:44,118 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 18:58:44,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 18:58:44,118 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 18:58:44,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:44,119 INFO L225 Difference]: With dead ends: 66 [2018-12-03 18:58:44,119 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 18:58:44,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 18:58:44,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 18:58:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 18:58:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 18:58:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 18:58:44,122 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 18:58:44,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:44,123 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 18:58:44,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 18:58:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 18:58:44,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 18:58:44,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:44,123 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 18:58:44,123 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:44,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:44,123 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-03 18:58:44,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:44,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:44,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:44,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:45,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:45,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:45,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:45,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:45,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:45,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:45,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:58:45,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:58:45,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:58:45,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:45,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:45,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:50,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:50,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 18:58:50,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:50,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 18:58:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 18:58:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:58:50,194 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 18:58:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:50,320 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 18:58:50,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 18:58:50,321 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 18:58:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:50,321 INFO L225 Difference]: With dead ends: 67 [2018-12-03 18:58:50,321 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 18:58:50,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 18:58:50,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 18:58:50,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 18:58:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 18:58:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 18:58:50,324 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 18:58:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:50,324 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 18:58:50,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 18:58:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 18:58:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 18:58:50,325 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:50,325 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 18:58:50,325 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:50,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:50,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-03 18:58:50,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:50,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:50,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:58:50,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:50,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:51,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:51,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:51,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:51,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:51,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:51,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:51,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:51,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:58:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:51,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:51,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:58:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:56,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:58:56,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 18:58:56,337 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:58:56,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 18:58:56,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 18:58:56,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 18:58:56,339 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 18:58:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:58:56,471 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 18:58:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 18:58:56,472 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 18:58:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:58:56,472 INFO L225 Difference]: With dead ends: 68 [2018-12-03 18:58:56,472 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 18:58:56,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 18:58:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 18:58:56,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 18:58:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 18:58:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 18:58:56,475 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 18:58:56,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:58:56,476 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 18:58:56,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 18:58:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 18:58:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 18:58:56,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:58:56,476 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 18:58:56,477 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:58:56,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:58:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-03 18:58:56,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:58:56,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:56,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:58:56,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:58:56,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:58:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:58:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:57,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:57,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:58:57,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:58:57,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:58:57,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:58:57,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:58:57,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:58:57,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:58:58,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 18:58:58,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:58:58,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:58:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:58:58,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:02,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:02,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 18:59:02,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:02,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 18:59:02,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 18:59:02,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 18:59:02,955 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 18:59:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:03,069 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 18:59:03,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 18:59:03,076 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 18:59:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:03,077 INFO L225 Difference]: With dead ends: 69 [2018-12-03 18:59:03,077 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 18:59:03,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 18:59:03,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 18:59:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 18:59:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 18:59:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 18:59:03,080 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 18:59:03,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:03,080 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 18:59:03,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 18:59:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 18:59:03,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 18:59:03,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:03,081 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 18:59:03,081 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:03,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-03 18:59:03,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:03,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:03,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:03,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:03,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:04,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:04,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:04,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:04,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:04,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:04,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:04,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:59:04,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:59:04,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:59:04,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:04,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:04,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:09,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:09,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 18:59:09,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:09,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 18:59:09,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 18:59:09,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:59:09,490 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 18:59:09,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:09,600 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 18:59:09,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 18:59:09,601 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 18:59:09,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:09,602 INFO L225 Difference]: With dead ends: 70 [2018-12-03 18:59:09,602 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 18:59:09,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 18:59:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 18:59:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 18:59:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 18:59:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 18:59:09,605 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 18:59:09,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:09,605 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 18:59:09,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 18:59:09,605 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 18:59:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 18:59:09,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:09,606 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 18:59:09,606 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:09,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-03 18:59:09,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:09,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:09,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:11,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:11,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:11,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:11,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:11,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:11,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:11,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:11,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:11,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:59:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:11,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:11,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:16,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:16,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:16,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 18:59:16,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:16,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 18:59:16,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 18:59:16,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 18:59:16,585 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 18:59:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:16,921 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 18:59:16,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 18:59:16,922 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 18:59:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:16,922 INFO L225 Difference]: With dead ends: 71 [2018-12-03 18:59:16,922 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 18:59:16,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 18:59:16,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 18:59:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 18:59:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 18:59:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 18:59:16,925 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 18:59:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:16,925 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 18:59:16,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 18:59:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 18:59:16,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 18:59:16,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:16,926 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 18:59:16,927 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:16,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:16,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-03 18:59:16,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:16,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:16,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:16,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:16,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:18,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:18,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:18,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:18,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:18,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:18,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:59:18,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:59:18,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 18:59:18,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:18,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:18,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:24,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:24,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 18:59:24,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:24,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 18:59:24,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 18:59:24,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:59:24,322 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 18:59:24,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:24,438 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 18:59:24,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 18:59:24,439 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 18:59:24,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:24,440 INFO L225 Difference]: With dead ends: 72 [2018-12-03 18:59:24,440 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 18:59:24,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 18:59:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 18:59:24,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 18:59:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 18:59:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 18:59:24,445 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 18:59:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:24,445 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 18:59:24,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 18:59:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 18:59:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 18:59:24,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:24,446 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 18:59:24,446 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:24,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:24,446 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-03 18:59:24,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:24,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:24,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:24,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:26,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:26,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:26,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:26,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:26,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:26,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:26,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:26,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:59:26,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:59:26,602 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:59:26,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:26,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:26,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:33,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:33,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 18:59:33,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:33,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 18:59:33,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 18:59:33,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:59:33,126 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 18:59:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:33,251 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 18:59:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 18:59:33,252 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 18:59:33,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:33,252 INFO L225 Difference]: With dead ends: 73 [2018-12-03 18:59:33,252 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 18:59:33,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 18:59:33,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 18:59:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 18:59:33,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 18:59:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 18:59:33,256 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 18:59:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:33,256 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 18:59:33,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 18:59:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 18:59:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 18:59:33,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:33,257 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 18:59:33,257 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:33,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:33,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-03 18:59:33,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:33,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:33,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:33,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:33,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:34,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:34,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:34,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:34,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:34,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:34,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:35,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:35,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:59:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:35,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:35,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:40,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:40,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:40,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 18:59:40,444 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:40,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 18:59:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 18:59:40,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 18:59:40,445 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 18:59:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:40,536 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 18:59:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 18:59:40,536 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 18:59:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:40,537 INFO L225 Difference]: With dead ends: 74 [2018-12-03 18:59:40,537 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 18:59:40,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 18:59:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 18:59:40,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 18:59:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 18:59:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 18:59:40,541 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 18:59:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:40,541 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 18:59:40,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 18:59:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 18:59:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 18:59:40,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:40,542 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 18:59:40,542 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:40,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:40,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-03 18:59:40,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:40,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:40,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:40,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:40,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:42,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:42,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:42,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:42,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:42,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:42,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:42,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:42,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:59:42,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:59:42,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 18:59:42,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:42,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:42,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:48,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:48,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 18:59:48,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:48,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 18:59:48,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 18:59:48,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 18:59:48,318 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 18:59:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:48,523 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 18:59:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 18:59:48,524 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 18:59:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:48,524 INFO L225 Difference]: With dead ends: 75 [2018-12-03 18:59:48,524 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 18:59:48,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 18:59:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 18:59:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 18:59:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 18:59:48,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 18:59:48,527 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 18:59:48,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:48,527 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 18:59:48,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 18:59:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 18:59:48,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 18:59:48,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:48,528 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 18:59:48,528 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:48,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-03 18:59:48,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:48,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:48,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:48,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:50,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:50,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:50,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:50,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:50,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:50,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:50,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:59:50,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:59:50,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:59:50,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:59:50,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:50,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:59:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:55,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:59:55,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 18:59:55,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:59:55,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 18:59:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 18:59:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:59:55,965 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 18:59:56,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:59:56,096 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 18:59:56,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 18:59:56,096 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 18:59:56,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:59:56,097 INFO L225 Difference]: With dead ends: 76 [2018-12-03 18:59:56,097 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 18:59:56,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 18:59:56,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 18:59:56,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 18:59:56,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 18:59:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 18:59:56,100 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 18:59:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:59:56,101 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 18:59:56,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 18:59:56,101 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 18:59:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 18:59:56,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:59:56,102 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 18:59:56,102 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:59:56,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:59:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-03 18:59:56,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:59:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:56,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:59:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:59:56,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:59:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:58,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:58,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:59:58,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:59:58,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:59:58,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:59:58,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:59:58,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:59:58,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:59:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:59:58,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:59:58,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:59:58,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:04,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:04,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 19:00:04,161 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:04,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 19:00:04,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 19:00:04,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 19:00:04,163 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 19:00:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:04,368 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 19:00:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 19:00:04,368 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 19:00:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:04,369 INFO L225 Difference]: With dead ends: 77 [2018-12-03 19:00:04,369 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 19:00:04,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 19:00:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 19:00:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 19:00:04,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 19:00:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 19:00:04,374 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 19:00:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:04,374 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 19:00:04,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 19:00:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 19:00:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 19:00:04,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:04,375 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 19:00:04,375 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:04,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-03 19:00:04,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:04,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:00:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:04,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:04,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:06,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:06,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:06,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:06,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:06,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:06,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:00:06,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:00:06,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:00:06,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 19:00:06,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:00:06,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:06,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:12,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:12,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 19:00:12,372 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:12,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 19:00:12,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 19:00:12,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 19:00:12,374 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 19:00:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:12,519 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 19:00:12,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 19:00:12,519 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 19:00:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:12,520 INFO L225 Difference]: With dead ends: 78 [2018-12-03 19:00:12,520 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 19:00:12,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 19:00:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 19:00:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 19:00:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 19:00:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 19:00:12,524 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 19:00:12,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:12,524 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 19:00:12,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 19:00:12,525 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 19:00:12,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 19:00:12,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:12,525 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 19:00:12,525 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:12,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:12,526 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-03 19:00:12,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:12,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:12,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:00:12,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:12,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:14,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:14,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:14,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:14,635 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:14,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:14,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:14,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:00:14,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:00:14,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:00:14,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:00:14,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:00:14,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:14,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:20,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:20,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 19:00:20,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:20,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 19:00:20,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 19:00:20,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 19:00:20,722 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 19:00:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:20,870 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 19:00:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 19:00:20,871 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 19:00:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:20,872 INFO L225 Difference]: With dead ends: 79 [2018-12-03 19:00:20,872 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 19:00:20,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 19:00:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 19:00:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 19:00:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 19:00:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 19:00:20,874 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 19:00:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:20,875 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 19:00:20,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 19:00:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 19:00:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 19:00:20,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:20,876 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 19:00:20,876 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:20,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-03 19:00:20,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:20,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:20,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:00:20,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:20,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:23,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:23,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:23,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:23,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:23,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:23,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:23,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:00:23,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:00:23,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:00:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:23,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:23,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:29,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:29,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 19:00:29,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:29,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 19:00:29,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 19:00:29,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 19:00:29,708 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 19:00:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:29,860 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 19:00:29,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 19:00:29,860 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 19:00:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:29,861 INFO L225 Difference]: With dead ends: 80 [2018-12-03 19:00:29,861 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 19:00:29,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 19:00:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 19:00:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 19:00:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 19:00:29,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 19:00:29,865 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 19:00:29,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:29,865 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 19:00:29,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 19:00:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 19:00:29,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 19:00:29,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:29,866 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 19:00:29,866 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:29,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-03 19:00:29,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:29,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:00:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:29,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:31,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:31,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:31,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:31,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:31,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:31,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:00:31,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:00:31,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:00:32,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 19:00:32,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:00:32,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:32,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:38,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:38,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 19:00:38,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:38,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 19:00:38,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 19:00:38,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 19:00:38,543 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 19:00:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:38,677 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 19:00:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 19:00:38,678 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 19:00:38,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:38,678 INFO L225 Difference]: With dead ends: 81 [2018-12-03 19:00:38,678 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 19:00:38,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 19:00:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 19:00:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 19:00:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 19:00:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 19:00:38,682 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 19:00:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:38,683 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 19:00:38,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 19:00:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 19:00:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 19:00:38,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:38,684 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 19:00:38,684 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:38,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-03 19:00:38,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:38,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:38,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:00:38,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:38,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:40,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:40,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:40,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:40,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:40,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:40,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:00:40,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:00:40,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:00:40,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:00:40,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:00:40,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:41,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:47,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:47,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:47,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 19:00:47,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:47,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 19:00:47,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 19:00:47,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 19:00:47,342 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 19:00:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:47,521 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 19:00:47,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 19:00:47,521 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 19:00:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:47,522 INFO L225 Difference]: With dead ends: 82 [2018-12-03 19:00:47,522 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 19:00:47,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 19:00:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 19:00:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 19:00:47,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 19:00:47,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 19:00:47,525 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 19:00:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:47,525 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 19:00:47,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 19:00:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 19:00:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 19:00:47,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:47,526 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 19:00:47,526 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:47,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:47,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-03 19:00:47,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:47,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:00:47,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:47,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:49,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:49,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:49,799 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:49,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:49,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:49,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:00:49,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:00:49,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:00:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:49,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:00:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:49,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:00:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:56,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:00:56,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 19:00:56,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:00:56,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 19:00:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 19:00:56,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 19:00:56,454 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 19:00:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:00:57,436 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 19:00:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 19:00:57,436 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 19:00:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:00:57,437 INFO L225 Difference]: With dead ends: 83 [2018-12-03 19:00:57,437 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 19:00:57,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 19:00:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 19:00:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 19:00:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 19:00:57,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 19:00:57,441 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 19:00:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:00:57,441 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 19:00:57,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 19:00:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 19:00:57,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 19:00:57,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:00:57,442 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 19:00:57,442 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:00:57,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:00:57,443 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-03 19:00:57,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:00:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:00:57,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:00:57,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:00:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:00:59,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:00:59,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:59,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:00:59,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:00:59,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:00:59,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:00:59,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:00:59,995 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:00:59,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:01:00,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 19:01:00,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:01:00,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:01:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:00,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:01:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:06,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:01:06,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 19:01:06,860 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:01:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 19:01:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 19:01:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 19:01:06,862 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 19:01:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:01:07,030 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 19:01:07,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 19:01:07,030 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 19:01:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:01:07,030 INFO L225 Difference]: With dead ends: 84 [2018-12-03 19:01:07,031 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 19:01:07,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 19:01:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 19:01:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 19:01:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 19:01:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 19:01:07,033 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 19:01:07,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:01:07,033 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 19:01:07,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 19:01:07,033 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 19:01:07,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 19:01:07,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:01:07,034 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 19:01:07,034 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:01:07,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:01:07,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-03 19:01:07,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:01:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:07,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:01:07,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:07,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:01:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:01:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:09,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:09,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:01:09,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:01:09,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:01:09,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:09,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:01:09,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:01:09,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:01:09,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:01:09,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:01:09,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:01:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:09,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:01:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:16,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:01:16,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 19:01:16,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:01:16,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 19:01:16,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 19:01:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 19:01:16,720 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 19:01:16,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:01:16,893 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 19:01:16,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 19:01:16,894 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 19:01:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:01:16,894 INFO L225 Difference]: With dead ends: 85 [2018-12-03 19:01:16,894 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 19:01:16,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 19:01:16,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 19:01:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 19:01:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 19:01:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 19:01:16,898 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 19:01:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:01:16,898 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 19:01:16,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 19:01:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 19:01:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 19:01:16,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:01:16,899 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 19:01:16,899 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:01:16,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:01:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-03 19:01:16,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:01:16,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:16,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:01:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:16,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:01:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:01:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:19,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:19,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:01:19,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:01:19,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:01:19,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:19,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:01:19,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:01:19,984 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:01:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:01:20,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:01:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:20,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:01:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:27,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:01:27,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 19:01:27,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:01:27,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 19:01:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 19:01:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 19:01:27,112 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 19:01:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:01:27,228 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 19:01:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 19:01:27,229 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 19:01:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:01:27,230 INFO L225 Difference]: With dead ends: 86 [2018-12-03 19:01:27,230 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 19:01:27,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 19:01:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 19:01:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 19:01:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 19:01:27,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 19:01:27,234 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 19:01:27,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:01:27,234 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 19:01:27,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 19:01:27,234 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 19:01:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 19:01:27,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:01:27,234 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 19:01:27,235 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:01:27,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:01:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-03 19:01:27,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:01:27,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:27,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:01:27,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:27,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:01:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:01:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:29,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:29,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:01:29,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:01:29,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:01:29,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:29,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:01:29,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:01:29,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:01:30,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 19:01:30,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:01:30,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:01:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:30,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:01:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:37,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:01:37,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 19:01:37,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:01:37,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 19:01:37,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 19:01:37,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 19:01:37,480 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 19:01:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:01:37,670 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 19:01:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 19:01:37,670 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 19:01:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:01:37,670 INFO L225 Difference]: With dead ends: 87 [2018-12-03 19:01:37,671 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 19:01:37,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 19:01:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 19:01:37,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 19:01:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 19:01:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 19:01:37,673 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 19:01:37,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:01:37,674 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 19:01:37,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 19:01:37,674 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 19:01:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 19:01:37,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:01:37,674 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 19:01:37,674 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:01:37,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:01:37,675 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-03 19:01:37,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:01:37,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:37,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:01:37,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:37,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:01:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:01:40,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:40,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:40,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:01:40,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:01:40,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:01:40,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:40,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:01:40,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:01:40,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:01:40,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:01:40,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:01:40,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:01:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:40,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:01:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:47,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:01:47,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 19:01:47,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:01:47,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 19:01:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 19:01:47,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 19:01:47,834 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 19:01:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:01:48,004 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 19:01:48,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 19:01:48,005 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 19:01:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:01:48,005 INFO L225 Difference]: With dead ends: 88 [2018-12-03 19:01:48,005 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 19:01:48,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 19:01:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 19:01:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 19:01:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 19:01:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 19:01:48,010 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 19:01:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:01:48,010 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 19:01:48,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 19:01:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 19:01:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 19:01:48,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:01:48,011 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 19:01:48,011 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:01:48,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:01:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-03 19:01:48,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:01:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:48,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:01:48,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:48,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:01:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:01:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:50,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:50,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:01:50,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:01:50,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:01:50,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:01:50,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:01:50,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:01:50,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:01:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:01:51,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:01:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:51,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:01:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:01:58,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:01:58,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 19:01:58,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:01:58,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 19:01:58,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 19:01:58,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 19:01:58,706 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 19:01:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:01:58,954 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 19:01:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 19:01:58,954 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 19:01:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:01:58,955 INFO L225 Difference]: With dead ends: 89 [2018-12-03 19:01:58,955 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 19:01:58,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 19:01:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 19:01:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 19:01:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 19:01:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 19:01:58,958 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 19:01:58,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:01:58,959 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 19:01:58,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 19:01:58,959 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 19:01:58,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 19:01:58,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:01:58,959 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 19:01:58,959 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:01:58,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:01:58,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-03 19:01:58,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:01:58,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:58,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:01:58,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:01:58,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:01:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:02:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:01,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:01,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:02:01,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:02:01,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:02:01,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:01,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:02:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:02:01,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:02:01,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 19:02:01,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:02:01,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:02:01,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:01,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:02:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:09,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:02:09,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 19:02:09,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:02:09,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 19:02:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 19:02:09,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 19:02:09,977 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 19:02:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:02:10,113 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 19:02:10,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 19:02:10,114 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 19:02:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:02:10,114 INFO L225 Difference]: With dead ends: 90 [2018-12-03 19:02:10,114 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 19:02:10,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 19:02:10,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 19:02:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 19:02:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 19:02:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 19:02:10,118 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 19:02:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:02:10,118 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 19:02:10,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 19:02:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 19:02:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 19:02:10,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:02:10,119 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 19:02:10,119 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:02:10,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:02:10,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-03 19:02:10,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:02:10,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:10,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:02:10,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:10,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:02:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:02:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:13,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:13,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:02:13,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:02:13,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:02:13,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:13,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:02:13,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:02:13,060 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:02:13,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:02:13,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:02:13,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:02:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:13,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:02:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:21,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:02:21,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 19:02:21,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:02:21,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 19:02:21,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 19:02:21,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 19:02:21,344 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 19:02:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:02:21,664 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 19:02:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 19:02:21,664 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 19:02:21,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:02:21,665 INFO L225 Difference]: With dead ends: 91 [2018-12-03 19:02:21,665 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 19:02:21,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 19:02:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 19:02:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 19:02:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 19:02:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 19:02:21,668 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 19:02:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:02:21,668 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 19:02:21,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 19:02:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 19:02:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 19:02:21,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:02:21,669 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 19:02:21,669 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:02:21,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:02:21,670 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-03 19:02:21,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:02:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:21,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:02:21,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:21,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:02:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:02:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:24,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:24,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:02:24,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:02:24,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:02:24,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:24,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:02:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:02:24,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:02:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:02:24,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:02:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:24,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:02:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:33,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:02:33,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 19:02:33,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:02:33,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 19:02:33,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 19:02:33,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 19:02:33,003 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 19:02:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:02:33,228 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 19:02:33,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 19:02:33,228 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 19:02:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:02:33,229 INFO L225 Difference]: With dead ends: 92 [2018-12-03 19:02:33,229 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 19:02:33,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 19:02:33,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 19:02:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 19:02:33,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 19:02:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 19:02:33,232 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 19:02:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:02:33,232 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 19:02:33,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 19:02:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 19:02:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 19:02:33,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:02:33,233 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 19:02:33,233 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:02:33,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:02:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-03 19:02:33,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:02:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:33,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:02:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:33,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:02:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:02:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:36,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:36,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:02:36,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:02:36,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:02:36,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:36,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:02:36,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:02:36,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:02:36,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 19:02:36,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:02:36,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:02:36,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:36,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:02:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:44,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:02:44,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 19:02:44,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:02:44,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 19:02:44,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 19:02:44,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 19:02:44,764 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 19:02:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:02:44,986 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 19:02:44,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 19:02:44,987 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 19:02:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:02:44,987 INFO L225 Difference]: With dead ends: 93 [2018-12-03 19:02:44,987 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 19:02:44,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 19:02:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 19:02:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 19:02:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 19:02:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 19:02:44,990 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 19:02:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:02:44,990 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 19:02:44,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 19:02:44,990 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 19:02:44,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 19:02:44,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:02:44,991 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 19:02:44,991 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:02:44,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:02:44,991 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-03 19:02:44,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:02:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:44,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:02:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:44,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:02:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:02:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:48,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:48,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:02:48,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:02:48,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:02:48,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:02:48,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:02:48,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:02:48,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:02:48,252 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:02:48,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:02:48,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:02:48,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:48,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:02:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:02:57,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:02:57,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 19:02:57,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:02:57,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 19:02:57,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 19:02:57,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 19:02:57,027 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 19:02:57,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:02:57,167 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 19:02:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 19:02:57,167 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 19:02:57,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:02:57,168 INFO L225 Difference]: With dead ends: 94 [2018-12-03 19:02:57,168 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 19:02:57,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 19:02:57,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 19:02:57,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 19:02:57,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 19:02:57,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 19:02:57,172 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 19:02:57,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:02:57,173 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 19:02:57,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 19:02:57,173 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 19:02:57,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 19:02:57,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:02:57,173 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 19:02:57,173 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:02:57,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:02:57,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-03 19:02:57,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:02:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:57,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:02:57,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:02:57,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:02:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:03:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:00,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:00,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:03:00,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:03:00,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:03:00,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:00,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:03:00,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:03:00,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:03:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:03:00,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:03:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:00,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:03:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:09,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:03:09,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 19:03:09,045 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:03:09,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 19:03:09,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 19:03:09,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 19:03:09,047 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 19:03:09,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:03:09,264 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 19:03:09,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 19:03:09,265 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 19:03:09,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:03:09,265 INFO L225 Difference]: With dead ends: 95 [2018-12-03 19:03:09,265 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 19:03:09,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 19:03:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 19:03:09,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 19:03:09,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 19:03:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 19:03:09,268 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 19:03:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:03:09,268 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 19:03:09,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 19:03:09,269 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 19:03:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 19:03:09,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:03:09,269 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 19:03:09,269 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:03:09,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:03:09,269 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-03 19:03:09,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:03:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:03:09,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:03:09,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:03:09,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:03:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:03:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:12,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:12,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:03:12,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:03:12,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:03:12,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:12,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:03:12,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:03:12,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:03:12,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 19:03:12,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:03:12,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:03:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:12,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:03:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:21,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:03:21,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 19:03:21,914 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:03:21,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 19:03:21,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 19:03:21,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 19:03:21,916 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 19:03:22,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:03:22,063 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 19:03:22,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 19:03:22,064 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 19:03:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:03:22,065 INFO L225 Difference]: With dead ends: 96 [2018-12-03 19:03:22,065 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 19:03:22,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 19:03:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 19:03:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 19:03:22,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 19:03:22,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 19:03:22,069 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 19:03:22,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:03:22,069 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 19:03:22,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 19:03:22,069 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 19:03:22,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 19:03:22,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:03:22,070 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 19:03:22,070 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:03:22,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:03:22,070 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-03 19:03:22,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:03:22,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:03:22,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:03:22,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:03:22,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:03:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:03:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:25,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:25,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:03:25,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:03:25,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:03:25,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:25,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:03:25,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:03:25,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:03:25,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:03:25,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:03:25,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:03:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:25,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:03:34,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:34,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:03:34,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 19:03:34,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:03:34,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 19:03:34,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 19:03:34,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 19:03:34,523 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 19:03:34,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:03:34,779 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 19:03:34,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 19:03:34,780 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 19:03:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:03:34,780 INFO L225 Difference]: With dead ends: 97 [2018-12-03 19:03:34,780 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 19:03:34,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 19:03:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 19:03:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 19:03:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 19:03:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 19:03:34,785 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 19:03:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:03:34,785 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 19:03:34,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 19:03:34,785 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 19:03:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 19:03:34,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:03:34,786 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 19:03:34,786 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:03:34,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:03:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-03 19:03:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:03:34,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:03:34,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:03:34,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:03:34,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:03:34,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:03:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:38,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:38,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:03:38,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:03:38,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:03:38,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:38,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:03:38,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:03:38,243 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:03:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:03:38,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:03:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:38,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:03:47,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:47,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:03:47,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 19:03:47,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:03:47,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 19:03:47,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 19:03:47,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 19:03:47,868 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 19:03:48,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:03:48,058 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 19:03:48,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 19:03:48,058 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 19:03:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:03:48,059 INFO L225 Difference]: With dead ends: 98 [2018-12-03 19:03:48,059 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 19:03:48,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 19:03:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 19:03:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 19:03:48,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 19:03:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 19:03:48,062 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 19:03:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:03:48,063 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 19:03:48,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 19:03:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 19:03:48,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 19:03:48,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:03:48,064 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 19:03:48,065 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:03:48,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:03:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-03 19:03:48,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:03:48,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:03:48,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:03:48,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:03:48,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:03:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:03:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:51,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:51,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:03:51,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:03:51,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:03:51,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:03:51,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:03:51,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:03:51,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:03:51,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 19:03:51,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:03:51,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:03:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:03:51,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:04:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:00,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:04:00,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 19:04:00,862 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:04:00,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 19:04:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 19:04:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 19:04:00,864 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 19:04:01,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:04:01,044 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 19:04:01,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 19:04:01,044 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 19:04:01,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:04:01,045 INFO L225 Difference]: With dead ends: 99 [2018-12-03 19:04:01,045 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 19:04:01,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 19:04:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 19:04:01,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 19:04:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 19:04:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 19:04:01,048 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 19:04:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:04:01,048 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 19:04:01,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 19:04:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 19:04:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 19:04:01,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:04:01,049 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 19:04:01,049 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:04:01,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:04:01,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-03 19:04:01,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:04:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:01,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:04:01,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:01,050 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:04:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:04:04,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:04,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:04:04,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:04:04,655 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:04:04,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:04:04,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:04:04,655 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:04:04,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:04:04,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:04:04,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:04:04,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:04:04,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:04:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:04,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:04:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:14,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:04:14,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 19:04:14,696 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:04:14,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 19:04:14,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 19:04:14,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 19:04:14,698 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 19:04:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:04:14,850 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 19:04:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 19:04:14,850 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 19:04:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:04:14,851 INFO L225 Difference]: With dead ends: 100 [2018-12-03 19:04:14,851 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 19:04:14,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 19:04:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 19:04:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 19:04:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 19:04:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 19:04:14,856 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 19:04:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:04:14,856 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 19:04:14,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 19:04:14,856 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 19:04:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 19:04:14,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:04:14,857 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 19:04:14,857 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:04:14,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:04:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-03 19:04:14,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:04:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:14,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:04:14,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:14,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:04:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:04:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:18,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:04:18,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:04:18,313 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:04:18,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:04:18,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:04:18,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:04:18,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:04:18,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:04:18,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:04:18,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:04:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:18,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:04:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:28,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:04:28,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 19:04:28,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:04:28,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 19:04:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 19:04:28,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 19:04:28,425 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 19:04:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:04:28,571 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 19:04:28,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 19:04:28,572 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 19:04:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:04:28,573 INFO L225 Difference]: With dead ends: 101 [2018-12-03 19:04:28,573 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 19:04:28,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 19:04:28,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 19:04:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 19:04:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 19:04:28,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 19:04:28,577 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 19:04:28,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:04:28,577 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 19:04:28,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 19:04:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 19:04:28,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 19:04:28,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:04:28,578 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 19:04:28,578 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:04:28,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:04:28,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-03 19:04:28,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:04:28,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:28,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:04:28,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:28,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:04:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:04:31,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:31,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:04:31,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:04:31,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:04:31,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:04:31,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:04:31,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:04:31,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:04:31,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:04:32,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 19:04:32,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:04:32,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:04:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:32,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:04:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:42,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:04:42,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 19:04:42,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:04:42,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 19:04:42,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 19:04:42,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 19:04:42,458 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 19:04:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:04:42,619 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 19:04:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 19:04:42,619 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 19:04:42,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:04:42,620 INFO L225 Difference]: With dead ends: 102 [2018-12-03 19:04:42,620 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 19:04:42,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 19:04:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 19:04:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 19:04:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 19:04:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 19:04:42,623 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 19:04:42,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:04:42,623 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 19:04:42,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 19:04:42,624 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 19:04:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 19:04:42,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:04:42,624 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 19:04:42,624 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:04:42,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:04:42,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-03 19:04:42,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:04:42,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:42,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:04:42,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:42,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:04:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:04:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:46,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:04:46,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:04:46,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:04:46,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:04:46,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:04:46,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:04:46,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:04:46,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:04:46,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:04:46,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:04:46,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:04:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:46,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:04:56,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:04:56,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:04:56,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 19:04:56,933 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:04:56,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 19:04:56,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 19:04:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 19:04:56,935 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 19:04:57,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:04:57,143 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 19:04:57,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 19:04:57,143 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 19:04:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:04:57,144 INFO L225 Difference]: With dead ends: 103 [2018-12-03 19:04:57,144 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 19:04:57,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 19:04:57,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 19:04:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 19:04:57,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 19:04:57,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 19:04:57,149 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 19:04:57,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:04:57,149 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 19:04:57,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 19:04:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 19:04:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 19:04:57,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:04:57,150 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 19:04:57,150 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:04:57,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:04:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-03 19:04:57,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:04:57,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:57,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:04:57,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:04:57,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:04:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:05:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:01,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:05:01,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:05:01,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:05:01,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:05:01,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:05:01,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:05:01,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:05:01,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:05:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:05:01,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:05:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:01,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:05:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:11,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:05:11,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 19:05:11,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:05:11,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 19:05:11,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 19:05:11,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 19:05:11,874 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 19:05:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:05:12,189 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 19:05:12,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 19:05:12,189 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 19:05:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:05:12,190 INFO L225 Difference]: With dead ends: 104 [2018-12-03 19:05:12,190 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 19:05:12,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 19:05:12,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 19:05:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 19:05:12,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 19:05:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 19:05:12,193 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 19:05:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:05:12,193 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 19:05:12,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 19:05:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 19:05:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 19:05:12,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:05:12,194 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 19:05:12,194 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:05:12,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:05:12,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-03 19:05:12,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:05:12,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:05:12,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:05:12,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:05:12,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:05:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:05:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:16,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:05:16,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:05:16,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:05:16,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:05:16,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:05:16,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:05:16,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:05:16,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:05:16,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 19:05:16,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:05:16,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:05:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:16,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:05:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:27,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:05:27,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 19:05:27,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:05:27,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 19:05:27,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 19:05:27,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 19:05:27,178 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 19:05:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:05:27,424 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 19:05:27,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 19:05:27,424 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 19:05:27,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:05:27,425 INFO L225 Difference]: With dead ends: 105 [2018-12-03 19:05:27,425 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 19:05:27,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 19:05:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 19:05:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 19:05:27,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 19:05:27,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 19:05:27,429 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 19:05:27,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:05:27,429 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 19:05:27,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 19:05:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 19:05:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 19:05:27,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:05:27,430 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 19:05:27,430 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:05:27,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:05:27,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-03 19:05:27,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:05:27,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:05:27,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:05:27,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:05:27,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:05:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:05:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:31,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:05:31,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:05:31,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:05:31,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:05:31,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:05:31,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:05:31,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:05:31,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:05:31,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:05:31,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:05:31,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:05:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:31,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:05:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:42,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:05:42,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 19:05:42,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:05:42,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 19:05:42,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 19:05:42,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 19:05:42,540 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 19:05:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:05:42,825 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 19:05:42,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 19:05:42,825 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 19:05:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:05:42,826 INFO L225 Difference]: With dead ends: 106 [2018-12-03 19:05:42,826 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 19:05:42,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 19:05:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 19:05:42,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 19:05:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 19:05:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 19:05:42,831 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 19:05:42,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:05:42,831 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 19:05:42,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 19:05:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 19:05:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 19:05:42,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:05:42,832 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 19:05:42,832 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:05:42,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:05:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-03 19:05:42,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:05:42,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:05:42,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:05:42,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:05:42,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:05:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:05:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:47,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:05:47,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:05:47,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:05:47,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:05:47,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:05:47,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:05:47,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:05:47,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:05:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:05:47,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:05:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:47,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:05:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:05:58,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:05:58,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 19:05:58,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:05:58,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 19:05:58,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 19:05:58,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 19:05:58,152 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 19:05:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:05:58,337 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 19:05:58,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 19:05:58,337 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 19:05:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:05:58,338 INFO L225 Difference]: With dead ends: 107 [2018-12-03 19:05:58,338 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 19:05:58,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 19:05:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 19:05:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 19:05:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 19:05:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 19:05:58,342 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 19:05:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:05:58,343 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 19:05:58,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 19:05:58,343 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 19:05:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 19:05:58,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:05:58,344 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 19:05:58,344 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:05:58,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:05:58,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-03 19:05:58,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:05:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:05:58,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:05:58,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:05:58,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:05:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:06:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:02,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:06:02,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:06:02,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:06:02,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:06:02,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:06:02,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:06:02,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:06:02,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:06:02,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 19:06:02,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:06:02,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:06:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:02,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:06:14,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:14,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:06:14,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 19:06:14,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:06:14,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 19:06:14,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 19:06:14,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 19:06:14,070 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 19:06:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:06:14,407 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 19:06:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 19:06:14,407 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 19:06:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:06:14,408 INFO L225 Difference]: With dead ends: 108 [2018-12-03 19:06:14,408 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 19:06:14,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 19:06:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 19:06:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 19:06:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 19:06:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 19:06:14,413 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 19:06:14,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:06:14,413 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 19:06:14,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 19:06:14,413 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 19:06:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 19:06:14,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:06:14,414 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 19:06:14,414 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:06:14,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:06:14,414 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-03 19:06:14,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:06:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:06:14,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:06:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:06:14,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:06:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:06:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:18,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:06:18,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:06:18,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:06:18,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:06:18,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:06:18,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:06:18,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:06:18,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:06:18,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:06:18,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:06:18,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:06:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:18,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:06:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:30,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:06:30,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 19:06:30,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:06:30,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 19:06:30,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 19:06:30,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 19:06:30,495 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 19:06:30,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:06:30,857 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 19:06:30,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 19:06:30,858 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 19:06:30,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:06:30,858 INFO L225 Difference]: With dead ends: 109 [2018-12-03 19:06:30,858 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 19:06:30,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 19:06:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 19:06:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 19:06:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 19:06:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 19:06:30,862 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 19:06:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:06:30,862 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 19:06:30,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 19:06:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 19:06:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 19:06:30,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:06:30,863 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 19:06:30,863 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:06:30,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:06:30,864 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-03 19:06:30,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:06:30,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:06:30,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:06:30,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:06:30,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:06:31,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:06:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:34,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:06:34,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:06:34,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:06:34,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:06:34,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:06:34,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:06:34,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:06:34,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:06:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:06:35,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:06:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:35,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:06:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:47,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:06:47,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 19:06:47,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:06:47,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 19:06:47,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 19:06:47,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 19:06:47,457 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 19:06:47,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:06:47,686 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 19:06:47,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 19:06:47,687 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 19:06:47,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:06:47,687 INFO L225 Difference]: With dead ends: 110 [2018-12-03 19:06:47,687 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 19:06:47,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 19:06:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 19:06:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 19:06:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 19:06:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 19:06:47,690 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 19:06:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:06:47,691 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 19:06:47,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 19:06:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 19:06:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 19:06:47,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:06:47,691 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 19:06:47,692 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:06:47,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:06:47,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-03 19:06:47,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:06:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:06:47,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:06:47,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:06:47,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:06:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:06:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:52,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:06:52,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:06:52,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:06:52,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:06:52,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:06:52,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:06:52,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:06:52,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:06:52,433 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 19:06:52,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:06:52,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:06:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:06:52,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:07:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:04,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:07:04,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 19:07:04,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:07:04,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 19:07:04,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 19:07:04,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 19:07:04,563 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 19:07:04,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:07:04,800 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 19:07:04,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 19:07:04,801 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 19:07:04,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:07:04,801 INFO L225 Difference]: With dead ends: 111 [2018-12-03 19:07:04,801 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 19:07:04,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 19:07:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 19:07:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 19:07:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 19:07:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 19:07:04,805 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 19:07:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:07:04,805 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 19:07:04,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 19:07:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 19:07:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 19:07:04,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:07:04,805 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 19:07:04,806 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:07:04,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:07:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-03 19:07:04,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:07:04,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:07:04,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:07:04,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:07:04,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:07:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:07:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:09,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:07:09,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:07:09,177 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:07:09,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:07:09,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:07:09,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:07:09,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:07:09,186 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:07:09,344 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:07:09,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:07:09,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:07:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:09,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:07:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:21,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:07:21,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 19:07:21,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:07:21,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 19:07:21,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 19:07:21,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 19:07:21,892 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 19:07:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:07:22,195 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 19:07:22,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 19:07:22,195 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 19:07:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:07:22,196 INFO L225 Difference]: With dead ends: 112 [2018-12-03 19:07:22,196 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 19:07:22,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 19:07:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 19:07:22,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 19:07:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 19:07:22,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 19:07:22,200 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 19:07:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:07:22,200 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 19:07:22,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 19:07:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 19:07:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 19:07:22,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:07:22,201 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 19:07:22,201 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:07:22,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:07:22,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-03 19:07:22,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:07:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:07:22,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:07:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:07:22,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:07:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:07:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:26,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:07:26,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:07:26,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:07:26,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:07:26,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:07:26,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:07:26,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:07:26,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:07:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:07:26,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:07:26,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:26,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:07:39,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:39,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:07:39,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 19:07:39,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:07:39,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 19:07:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 19:07:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 19:07:39,274 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 19:07:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:07:39,535 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 19:07:39,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 19:07:39,535 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 19:07:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:07:39,535 INFO L225 Difference]: With dead ends: 113 [2018-12-03 19:07:39,535 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 19:07:39,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 19:07:39,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 19:07:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 19:07:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 19:07:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 19:07:39,540 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 19:07:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:07:39,540 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 19:07:39,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 19:07:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 19:07:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 19:07:39,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:07:39,541 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 19:07:39,541 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:07:39,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:07:39,542 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-03 19:07:39,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:07:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:07:39,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:07:39,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:07:39,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:07:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:07:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:44,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:07:44,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:07:44,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:07:44,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:07:44,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:07:44,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:07:44,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:07:44,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:07:44,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 19:07:44,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:07:44,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:07:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:44,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:07:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:07:56,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:07:56,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 19:07:56,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:07:56,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 19:07:56,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 19:07:57,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 19:07:57,000 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 19:07:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:07:57,345 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 19:07:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 19:07:57,346 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 19:07:57,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:07:57,346 INFO L225 Difference]: With dead ends: 114 [2018-12-03 19:07:57,346 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 19:07:57,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 19:07:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 19:07:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 19:07:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 19:07:57,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 19:07:57,350 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 19:07:57,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:07:57,350 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 19:07:57,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 19:07:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 19:07:57,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 19:07:57,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:07:57,351 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 19:07:57,351 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:07:57,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:07:57,352 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-03 19:07:57,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:07:57,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:07:57,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:07:57,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:07:57,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:07:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:08:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:08:01,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:08:01,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:08:01,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:08:01,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:08:01,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:08:01,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:08:01,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:08:01,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:08:02,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:08:02,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:08:02,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:08:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:08:02,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:08:15,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:08:15,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:08:15,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 19:08:15,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:08:15,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 19:08:15,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 19:08:15,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 19:08:15,069 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 19:08:15,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:08:15,372 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 19:08:15,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 19:08:15,373 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 19:08:15,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:08:15,374 INFO L225 Difference]: With dead ends: 115 [2018-12-03 19:08:15,374 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 19:08:15,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 19:08:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 19:08:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 19:08:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 19:08:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 19:08:15,379 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 19:08:15,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:08:15,379 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 19:08:15,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 19:08:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 19:08:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 19:08:15,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:08:15,380 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 19:08:15,380 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:08:15,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:08:15,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-03 19:08:15,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:08:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:08:15,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:08:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:08:15,381 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:08:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:08:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:08:19,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:08:19,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:08:19,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:08:19,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:08:19,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:08:19,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:08:19,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:08:19,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:08:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:08:20,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:08:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:08:20,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:08:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:08:33,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:08:33,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 19:08:33,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:08:33,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 19:08:33,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 19:08:33,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 19:08:33,370 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 19:08:33,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:08:33,635 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 19:08:33,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 19:08:33,635 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 19:08:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:08:33,636 INFO L225 Difference]: With dead ends: 116 [2018-12-03 19:08:33,636 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 19:08:33,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 19:08:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 19:08:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 19:08:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 19:08:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 19:08:33,640 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 19:08:33,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:08:33,640 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 19:08:33,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 19:08:33,640 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 19:08:33,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 19:08:33,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:08:33,641 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 19:08:33,641 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:08:33,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:08:33,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2018-12-03 19:08:33,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:08:33,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:08:33,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:08:33,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:08:33,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:08:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:08:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:08:38,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:08:38,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:08:38,137 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:08:38,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:08:38,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:08:38,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:08:38,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:08:38,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:08:38,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 19:08:38,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:08:38,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:08:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:08:38,434 INFO L316 TraceCheckSpWp]: Computing backward predicates...