java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:28:38,708 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:28:38,711 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:28:38,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:28:38,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:28:38,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:28:38,734 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:28:38,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:28:38,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:28:38,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:28:38,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:28:38,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:28:38,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:28:38,747 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:28:38,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:28:38,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:28:38,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:28:38,762 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:28:38,769 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:28:38,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:28:38,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:28:38,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:28:38,778 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:28:38,778 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:28:38,779 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:28:38,780 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:28:38,781 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:28:38,781 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:28:38,782 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:28:38,783 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:28:38,784 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:28:38,784 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:28:38,784 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:28:38,785 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:28:38,786 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:28:38,786 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:28:38,787 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:28:38,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:28:38,800 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:28:38,801 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:28:38,801 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:28:38,802 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:28:38,802 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:28:38,802 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:28:38,802 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:28:38,803 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:28:38,803 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:28:38,803 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:28:38,803 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:28:38,803 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:28:38,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:28:38,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:28:38,805 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:28:38,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:28:38,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:28:38,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:28:38,805 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:28:38,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:28:38,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:28:38,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:28:38,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:28:38,806 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:28:38,807 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:28:38,807 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:28:38,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:28:38,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:28:38,808 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:28:38,808 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:28:38,808 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:28:38,808 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:28:38,808 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:28:38,809 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:28:38,809 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:28:38,809 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:28:38,809 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:28:38,809 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:28:38,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:28:38,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:28:38,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:28:38,867 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:28:38,868 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:28:38,869 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2018-12-03 17:28:38,870 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-12-03 17:28:38,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:28:38,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:28:38,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:38,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:28:38,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:28:38,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:38,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:38,984 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:38,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:28:38,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:28:38,986 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:28:39,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:39,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:39,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:39,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:39,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:39,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:39,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... [2018-12-03 17:28:39,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:28:39,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:28:39,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:28:39,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:28:39,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:28:39,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:28:39,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:28:39,287 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:28:39,287 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-03 17:28:39,288 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:39 BoogieIcfgContainer [2018-12-03 17:28:39,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:28:39,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:28:39,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:28:39,295 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:28:39,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:38" (1/2) ... [2018-12-03 17:28:39,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3756663a and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:28:39, skipping insertion in model container [2018-12-03 17:28:39,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:39" (2/2) ... [2018-12-03 17:28:39,299 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-12-03 17:28:39,310 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:28:39,318 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:28:39,337 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:28:39,371 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:28:39,372 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:28:39,372 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:28:39,372 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:28:39,372 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:28:39,373 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:28:39,373 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:28:39,373 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:28:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-03 17:28:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:28:39,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:39,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:28:39,401 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:39,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:39,407 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-03 17:28:39,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:39,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:39,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:39,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:39,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:39,547 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:39,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:39,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:39,566 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-03 17:28:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:39,641 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-03 17:28:39,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:39,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 17:28:39,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:39,660 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:28:39,665 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:28:39,669 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 17:28:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:28:39,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:28:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:28:39,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 17:28:39,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-03 17:28:39,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:39,702 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 17:28:39,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:39,702 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 17:28:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:28:39,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:39,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 17:28:39,703 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:39,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-03 17:28:39,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:39,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:39,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:39,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:39,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:28:39,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:28:39,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:28:39,867 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 17:28:39,871 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-03 17:28:39,989 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:28:39,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:29:02,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:29:02,683 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:29:02,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:02,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:29:02,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:02,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:02,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:02,712 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:02,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:29:02,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 17:29:02,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:02,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 17:29:02,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:02,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:29:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:29:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:29:02,799 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 17:29:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:02,859 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 17:29:02,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:29:02,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 17:29:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:02,860 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:29:02,861 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:29:02,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:29:02,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:29:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:29:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:29:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 17:29:02,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 17:29:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:02,866 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 17:29:02,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:29:02,866 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 17:29:02,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:29:02,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:02,867 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-03 17:29:02,868 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:02,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:02,868 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2018-12-03 17:29:02,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:02,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:02,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:02,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:29:02,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:02,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:02,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:02,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:02,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:02,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:02,965 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:02,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:02,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:29:02,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:02,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:29:02,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 17:29:03,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:03,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 17:29:03,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:03,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:29:03,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:29:03,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:29:03,079 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-03 17:29:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:03,104 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-03 17:29:03,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:29:03,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-03 17:29:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:03,106 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:29:03,106 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:29:03,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:29:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:29:03,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:29:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:29:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 17:29:03,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-03 17:29:03,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:03,111 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 17:29:03,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:29:03,111 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 17:29:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:29:03,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:03,112 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-03 17:29:03,112 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:03,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2018-12-03 17:29:03,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:03,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:03,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:03,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:03,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:29:03,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:03,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:03,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:03,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:03,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:03,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:03,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:03,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:03,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:03,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:03,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:29:03,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 17:29:03,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:03,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 17:29:03,335 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:03,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:29:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:29:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:29:03,337 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-03 17:29:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:03,374 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-03 17:29:03,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:29:03,375 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 17:29:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:03,375 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:29:03,376 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:29:03,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:29:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:29:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:29:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:29:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 17:29:03,380 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-03 17:29:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:03,380 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 17:29:03,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:29:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 17:29:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:29:03,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:03,381 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-03 17:29:03,381 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:03,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2018-12-03 17:29:03,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:03,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:03,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 17:29:03,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:03,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:03,519 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:03,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:03,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:03,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:03,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:03,528 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:03,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 17:29:03,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 17:29:03,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:03,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 17:29:03,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:03,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:29:03,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:29:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:29:03,749 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-03 17:29:03,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:03,788 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-03 17:29:03,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:29:03,788 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 17:29:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:03,789 INFO L225 Difference]: With dead ends: 22 [2018-12-03 17:29:03,789 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:29:03,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:29:03,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:29:03,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:29:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:29:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 17:29:03,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-03 17:29:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:03,794 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 17:29:03,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:29:03,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 17:29:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:29:03,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:03,795 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-03 17:29:03,796 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:03,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:03,796 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2018-12-03 17:29:03,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:03,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:03,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:03,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:03,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 17:29:04,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:04,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:04,146 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:04,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:04,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:04,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:04,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:04,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:04,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:29:04,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:04,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:04,175 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 17:29:04,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 17:29:04,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:04,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 17:29:04,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:04,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:29:04,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:29:04,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:29:04,317 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-03 17:29:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:04,350 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-03 17:29:04,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:29:04,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-03 17:29:04,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:04,352 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:29:04,352 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:29:04,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:29:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:29:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:29:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:29:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-03 17:29:04,356 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-03 17:29:04,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:04,357 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-03 17:29:04,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:29:04,357 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-03 17:29:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:29:04,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:04,358 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-03 17:29:04,358 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:04,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2018-12-03 17:29:04,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:04,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:04,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:04,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:04,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 17:29:04,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:04,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:04,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:04,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:04,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:04,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:04,530 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:04,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:04,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:04,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:04,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 17:29:04,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-03 17:29:04,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:04,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 17:29:04,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:04,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:29:04,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:29:04,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:29:04,662 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-03 17:29:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:04,763 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-03 17:29:04,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:29:04,763 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 17:29:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:04,764 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:29:04,764 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:29:04,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:29:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:29:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:29:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:29:04,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 17:29:04,770 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-03 17:29:04,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:04,771 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 17:29:04,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:29:04,771 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 17:29:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:29:04,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:04,772 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-03 17:29:04,773 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:04,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:04,773 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2018-12-03 17:29:04,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:04,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:04,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:04,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:04,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:04,925 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 17:29:04,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:04,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:04,926 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:04,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:04,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:04,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:04,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:04,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:04,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 17:29:04,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:05,144 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 17:29:05,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:05,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:29:05,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:05,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:29:05,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:29:05,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:29:05,167 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-03 17:29:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:05,205 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-03 17:29:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:29:05,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 17:29:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:05,207 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:29:05,207 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:29:05,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:29:05,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:29:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:29:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:29:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 17:29:05,212 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 17:29:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:05,212 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 17:29:05,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:29:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 17:29:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:29:05,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:05,213 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-03 17:29:05,213 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:05,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:05,213 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2018-12-03 17:29:05,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:05,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:05,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:05,470 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:29:05,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:05,470 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:05,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:05,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:05,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:05,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:05,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:05,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:05,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:29:05,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:05,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:29:05,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 17:29:05,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:05,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:29:05,669 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:05,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:29:05,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:29:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:29:05,671 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-03 17:29:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:05,814 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-03 17:29:05,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:29:05,815 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 17:29:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:05,815 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:29:05,815 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:29:05,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:29:05,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:29:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:29:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:29:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-03 17:29:05,821 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-03 17:29:05,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:05,821 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-03 17:29:05,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:29:05,821 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-03 17:29:05,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:29:05,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:05,822 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-03 17:29:05,822 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:05,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:05,822 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2018-12-03 17:29:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:05,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:05,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:05,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 17:29:05,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:05,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:05,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:05,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:05,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:05,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:05,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:05,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:06,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:06,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:06,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 17:29:06,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-03 17:29:06,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:06,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:29:06,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:06,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:29:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:29:06,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:29:06,406 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-03 17:29:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:06,493 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-03 17:29:06,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:29:06,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-03 17:29:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:06,494 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:29:06,494 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:29:06,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:29:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:29:06,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:29:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:29:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 17:29:06,499 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-03 17:29:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:06,499 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 17:29:06,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:29:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 17:29:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:29:06,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:06,500 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-03 17:29:06,500 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:06,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2018-12-03 17:29:06,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:06,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:06,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:06,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 17:29:06,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:06,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:06,625 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:06,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:06,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:06,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:06,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:06,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:06,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:06,665 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 17:29:06,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:06,887 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-03 17:29:06,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:06,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 17:29:06,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:06,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:29:06,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:29:06,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:29:06,909 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 17:29:06,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:06,966 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-03 17:29:06,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:29:06,967 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 17:29:06,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:06,968 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:29:06,968 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:29:06,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:29:06,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:29:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:29:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:29:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 17:29:06,973 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 17:29:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:06,973 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 17:29:06,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:29:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 17:29:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:29:06,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:06,974 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-03 17:29:06,974 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:06,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:06,974 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2018-12-03 17:29:06,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:06,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:06,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:06,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 17:29:07,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:07,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:07,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:07,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:07,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:07,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:07,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:07,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:07,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 17:29:07,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:07,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:07,182 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 17:29:07,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-03 17:29:07,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:07,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 17:29:07,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:07,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:29:07,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:29:07,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:29:07,414 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-03 17:29:07,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:07,492 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-03 17:29:07,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:29:07,492 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-03 17:29:07,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:07,493 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:29:07,493 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:29:07,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:29:07,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:29:07,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:29:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:29:07,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-03 17:29:07,499 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-03 17:29:07,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:07,500 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-03 17:29:07,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:29:07,500 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-03 17:29:07,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:29:07,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:07,501 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-03 17:29:07,501 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:07,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:07,501 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2018-12-03 17:29:07,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:07,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:07,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:07,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:07,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:07,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 17:29:07,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:07,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:07,641 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:07,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:07,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:07,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:07,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:07,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:07,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:07,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:07,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 17:29:07,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-03 17:29:07,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:07,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 17:29:07,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:07,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:29:07,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:29:07,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:29:07,988 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-03 17:29:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:08,144 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-03 17:29:08,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:29:08,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-03 17:29:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:08,145 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:29:08,146 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:29:08,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:29:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:29:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:29:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:29:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 17:29:08,151 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-03 17:29:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:08,152 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 17:29:08,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:29:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 17:29:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:29:08,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:08,153 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-03 17:29:08,153 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:08,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:08,153 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2018-12-03 17:29:08,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:08,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:08,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:08,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-03 17:29:08,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:08,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:08,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:08,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:08,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:08,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:08,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:08,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:08,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:08,451 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-03 17:29:08,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-03 17:29:08,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:08,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 17:29:08,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:08,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:29:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:29:08,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:29:08,965 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-03 17:29:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:09,031 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-03 17:29:09,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:29:09,031 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-03 17:29:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:09,032 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:29:09,032 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:29:09,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:29:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:29:09,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:29:09,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:29:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 17:29:09,038 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-03 17:29:09,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:09,038 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 17:29:09,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:29:09,038 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 17:29:09,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:29:09,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:09,039 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-03 17:29:09,039 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:09,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:09,040 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2018-12-03 17:29:09,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:09,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:09,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:09,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-03 17:29:09,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:09,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:09,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:09,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:09,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:09,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:09,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:09,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:09,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:29:09,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:09,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-03 17:29:09,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-03 17:29:09,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:09,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 17:29:09,685 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:09,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:29:09,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:29:09,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:29:09,686 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-03 17:29:09,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:09,779 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-03 17:29:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:29:09,780 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-03 17:29:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:09,781 INFO L225 Difference]: With dead ends: 52 [2018-12-03 17:29:09,781 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:29:09,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:29:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:29:09,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 17:29:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:29:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-03 17:29:09,786 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-03 17:29:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:09,787 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-03 17:29:09,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:29:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-03 17:29:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:29:09,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:09,788 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-03 17:29:09,788 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:09,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2018-12-03 17:29:09,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:09,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:09,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:09,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:09,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:10,039 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 17:29:10,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:10,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:10,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:10,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 17:29:10,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:10,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:10,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:10,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:10,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:10,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:10,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:10,096 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 17:29:10,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-03 17:29:10,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:10,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 17:29:10,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:10,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:29:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:29:10,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:29:10,548 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-03 17:29:10,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:10,621 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-03 17:29:10,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:29:10,622 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-03 17:29:10,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:10,623 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:29:10,623 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:29:10,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:29:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:29:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:29:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:29:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 17:29:10,628 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-03 17:29:10,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:10,628 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 17:29:10,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:29:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 17:29:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:29:10,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:10,629 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-03 17:29:10,630 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:10,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2018-12-03 17:29:10,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:10,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:10,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 17:29:11,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:11,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:11,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:11,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:11,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:11,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:11,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:11,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:11,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 17:29:11,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-03 17:29:12,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:12,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 17:29:12,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:12,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:29:12,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:29:12,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:29:12,202 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-03 17:29:12,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:12,269 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-03 17:29:12,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:29:12,269 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-03 17:29:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:12,270 INFO L225 Difference]: With dead ends: 58 [2018-12-03 17:29:12,270 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:29:12,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:29:12,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:29:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 17:29:12,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:29:12,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 17:29:12,276 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-03 17:29:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:12,276 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 17:29:12,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:29:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 17:29:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:29:12,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:12,278 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-03 17:29:12,278 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:12,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2018-12-03 17:29:12,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:12,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:12,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-03 17:29:12,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:12,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:12,533 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:12,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:12,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:12,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:12,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:12,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:12,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:29:12,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:12,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-03 17:29:12,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-03 17:29:13,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:13,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 17:29:13,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:13,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:29:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:29:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:29:13,362 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-03 17:29:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:13,437 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-03 17:29:13,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:29:13,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-03 17:29:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:13,439 INFO L225 Difference]: With dead ends: 61 [2018-12-03 17:29:13,439 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:29:13,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:29:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:29:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 17:29:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:29:13,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-03 17:29:13,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-03 17:29:13,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:13,446 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-03 17:29:13,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:29:13,446 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-03 17:29:13,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:29:13,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:13,447 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-03 17:29:13,447 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:13,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:13,447 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2018-12-03 17:29:13,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:13,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:13,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:13,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:13,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-03 17:29:14,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:14,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:14,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:14,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:14,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:14,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:14,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:14,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:14,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:14,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:14,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-03 17:29:14,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-03 17:29:15,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:15,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 17:29:15,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:15,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:29:15,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:29:15,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:29:15,151 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-03 17:29:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:15,334 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-03 17:29:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:29:15,334 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-03 17:29:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:15,335 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:29:15,335 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:29:15,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:29:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:29:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:29:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:29:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 17:29:15,343 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-03 17:29:15,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:15,343 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 17:29:15,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:29:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 17:29:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:29:15,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:15,344 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-03 17:29:15,344 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:15,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:15,345 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2018-12-03 17:29:15,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:15,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:15,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:15,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-03 17:29:16,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:16,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:16,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:16,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:16,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:16,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:16,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:16,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:16,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-03 17:29:16,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-03 17:29:17,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:17,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 17:29:17,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:17,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:29:17,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:29:17,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:29:17,139 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-03 17:29:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:17,214 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-03 17:29:17,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:29:17,214 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-03 17:29:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:17,216 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:29:17,216 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:29:17,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:29:17,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:29:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:29:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:29:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 17:29:17,223 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 17:29:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:17,223 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 17:29:17,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:29:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 17:29:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:29:17,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:17,224 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-03 17:29:17,225 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:17,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:17,225 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2018-12-03 17:29:17,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:17,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:17,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:17,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 17:29:17,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:17,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:17,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:17,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 17:29:17,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:17,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:17,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:17,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:17,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:29:17,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:17,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 17:29:17,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-03 17:29:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:18,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 17:29:18,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:18,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:29:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:29:18,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:29:18,268 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-03 17:29:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:18,342 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-03 17:29:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:29:18,342 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-03 17:29:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:18,343 INFO L225 Difference]: With dead ends: 70 [2018-12-03 17:29:18,344 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:29:18,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:29:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:29:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 17:29:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:29:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-03 17:29:18,350 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-03 17:29:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:18,350 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-03 17:29:18,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:29:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-03 17:29:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:29:18,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:18,351 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-03 17:29:18,351 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:18,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2018-12-03 17:29:18,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:18,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:18,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:18,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:18,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:18,680 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-03 17:29:18,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:18,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:18,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:18,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:18,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:18,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:18,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:18,690 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:18,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:18,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:18,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-03 17:29:18,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-03 17:29:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:19,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 17:29:19,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:19,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:29:19,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:29:19,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:29:19,508 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-03 17:29:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:19,588 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-03 17:29:19,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:29:19,591 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-03 17:29:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:19,592 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:29:19,592 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:29:19,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:29:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:29:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 17:29:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:29:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 17:29:19,596 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-03 17:29:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:19,596 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 17:29:19,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:29:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 17:29:19,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:29:19,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:19,597 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-03 17:29:19,598 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:19,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:19,598 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2018-12-03 17:29:19,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:19,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:19,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:19,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:19,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 17:29:19,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:19,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:19,892 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:19,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:19,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:19,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:19,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:19,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:19,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 17:29:19,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:20,552 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-03 17:29:20,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:20,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 17:29:20,571 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:20,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:29:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:29:20,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:29:20,573 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-03 17:29:20,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:20,717 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-03 17:29:20,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:29:20,720 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-03 17:29:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:20,720 INFO L225 Difference]: With dead ends: 76 [2018-12-03 17:29:20,721 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:29:20,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 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 17:29:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:29:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 17:29:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:29:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 17:29:20,725 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 17:29:20,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:20,726 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 17:29:20,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:29:20,726 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 17:29:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:29:20,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:20,727 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-03 17:29:20,727 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:20,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2018-12-03 17:29:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:20,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:20,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:20,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:20,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:21,063 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-03 17:29:21,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:21,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:21,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:21,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:21,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:21,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:29:21,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:21,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:21,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:29:21,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:21,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-03 17:29:21,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:21,961 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-03 17:29:21,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:21,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 17:29:21,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:21,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:29:21,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:29:21,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:29:21,982 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-03 17:29:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:22,068 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-03 17:29:22,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:29:22,068 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-03 17:29:22,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:22,069 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:29:22,069 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:29:22,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:29:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:29:22,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:29:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:29:22,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-03 17:29:22,075 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-03 17:29:22,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:22,075 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-03 17:29:22,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:29:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-03 17:29:22,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:29:22,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:22,076 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-03 17:29:22,076 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:22,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2018-12-03 17:29:22,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:22,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:22,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:22,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-03 17:29:22,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:22,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:22,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:22,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:22,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:22,638 INFO 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 17:29:22,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:22,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:22,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:22,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:22,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-03 17:29:22,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:23,498 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-03 17:29:23,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:23,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 17:29:23,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:23,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:29:23,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:29:23,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:29:23,520 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-03 17:29:23,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:23,642 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-03 17:29:23,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:29:23,643 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-03 17:29:23,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:23,644 INFO L225 Difference]: With dead ends: 82 [2018-12-03 17:29:23,644 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 17:29:23,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:29:23,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 17:29:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 17:29:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 17:29:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 17:29:23,650 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-03 17:29:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:23,650 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 17:29:23,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:29:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 17:29:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:29:23,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:23,651 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-03 17:29:23,651 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:23,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:23,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2018-12-03 17:29:23,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:23,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:23,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:23,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:23,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-03 17:29:24,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:24,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:24,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:24,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:24,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:24,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:24,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:24,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:24,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:24,505 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-03 17:29:24,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-03 17:29:25,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:25,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 17:29:25,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:25,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:29:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:29:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:29:25,821 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-03 17:29:25,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:25,912 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-03 17:29:25,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:29:25,919 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-03 17:29:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:25,919 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:29:25,920 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:29:25,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:29:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:29:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 17:29:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:29:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 17:29:25,933 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-03 17:29:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:25,933 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 17:29:25,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:29:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 17:29:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 17:29:25,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:25,935 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-03 17:29:25,935 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:25,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:25,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2018-12-03 17:29:25,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:25,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:25,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:25,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:25,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:26,571 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-03 17:29:26,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:26,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:26,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:26,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:26,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:26,572 INFO 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 17:29:26,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:26,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:26,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:29:26,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:26,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-03 17:29:26,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-03 17:29:27,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:27,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 17:29:27,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:27,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:29:27,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:29:27,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:29:27,603 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-03 17:29:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:27,699 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-03 17:29:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:29:27,700 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-03 17:29:27,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:27,701 INFO L225 Difference]: With dead ends: 88 [2018-12-03 17:29:27,701 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:29:27,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:29:27,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:29:27,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 17:29:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:29:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-03 17:29:27,706 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-03 17:29:27,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:27,707 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-03 17:29:27,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:29:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-03 17:29:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:29:27,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:27,708 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-03 17:29:27,708 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:27,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:27,708 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2018-12-03 17:29:27,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:27,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:27,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:27,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:27,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:28,602 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-03 17:29:28,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:28,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:28,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:28,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:28,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:28,603 INFO 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 17:29:28,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:28,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:28,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:28,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:28,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-03 17:29:28,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-03 17:29:29,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:29,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 17:29:29,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:29,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:29:29,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:29:29,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:29:29,858 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-03 17:29:29,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:29,986 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-12-03 17:29:29,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:29:29,987 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-03 17:29:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:29,987 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:29:29,988 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:29:29,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:29:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:29:29,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 17:29:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 17:29:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 17:29:29,993 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-03 17:29:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:29,993 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 17:29:29,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:29:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 17:29:29,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 17:29:29,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:29,994 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-03 17:29:29,994 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:29,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:29,995 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2018-12-03 17:29:29,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:29,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:29,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:29,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:29,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-03 17:29:30,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:30,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:30,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:30,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 17:29:30,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:30,585 INFO 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 17:29:30,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:30,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:30,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-03 17:29:30,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-03 17:29:32,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:32,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 17:29:32,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:32,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:29:32,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:29:32,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:29:32,051 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-03 17:29:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:32,179 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-03 17:29:32,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:29:32,180 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-03 17:29:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:32,181 INFO L225 Difference]: With dead ends: 94 [2018-12-03 17:29:32,181 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:29:32,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:29:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:29:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 17:29:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:29:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 17:29:32,186 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-03 17:29:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:32,187 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 17:29:32,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:29:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 17:29:32,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:29:32,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:32,188 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-03 17:29:32,188 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:32,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:32,188 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2018-12-03 17:29:32,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:32,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:32,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:32,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-03 17:29:32,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:32,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:32,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:32,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:32,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:32,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:32,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:32,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:32,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:29:32,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:32,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-03 17:29:32,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-03 17:29:34,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:34,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 17:29:34,539 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:34,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:29:34,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:29:34,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:29:34,541 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-03 17:29:34,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:34,658 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-03 17:29:34,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:29:34,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-03 17:29:34,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:34,660 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:29:34,660 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:29:34,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:29:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:29:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 17:29:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:29:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-03 17:29:34,664 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-12-03 17:29:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:34,664 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-03 17:29:34,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:29:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-03 17:29:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 17:29:34,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:34,665 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-03 17:29:34,665 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:34,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:34,665 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2018-12-03 17:29:34,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:34,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:34,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:34,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:34,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:35,212 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 17:29:35,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:35,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:35,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:35,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:35,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:35,212 INFO 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 17:29:35,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:35,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:35,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:35,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:35,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 17:29:35,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:36,328 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-03 17:29:36,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:36,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 17:29:36,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:36,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:29:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:29:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:29:36,351 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-03 17:29:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:36,501 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-03 17:29:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:29:36,501 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-03 17:29:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:36,502 INFO L225 Difference]: With dead ends: 100 [2018-12-03 17:29:36,502 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 17:29:36,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:29:36,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 17:29:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 17:29:36,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:29:36,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 17:29:36,505 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-03 17:29:36,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:36,506 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 17:29:36,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:29:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 17:29:36,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:29:36,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:36,506 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-03 17:29:36,507 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:36,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:36,507 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2018-12-03 17:29:36,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:36,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:36,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:36,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:36,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:37,037 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-03 17:29:37,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:37,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:37,038 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:37,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:37,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:37,038 INFO 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 17:29:37,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:37,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:37,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:37,113 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-03 17:29:37,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-03 17:29:38,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:38,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 17:29:38,290 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:38,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:29:38,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:29:38,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:29:38,292 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-03 17:29:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:38,415 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-12-03 17:29:38,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:29:38,416 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-03 17:29:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:38,417 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:29:38,417 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:29:38,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:29:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:29:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 17:29:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:29:38,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 17:29:38,421 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 17:29:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:38,422 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 17:29:38,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:29:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 17:29:38,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:29:38,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:38,422 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-03 17:29:38,423 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:38,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:38,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2018-12-03 17:29:38,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:38,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:38,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:38,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-03 17:29:39,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:39,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:39,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:39,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:39,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:39,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:39,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:39,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:39,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 17:29:39,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:39,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-03 17:29:39,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-03 17:29:41,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:41,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 17:29:41,252 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:41,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:29:41,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:29:41,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:29:41,254 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-03 17:29:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:41,422 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-03 17:29:41,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:29:41,423 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-03 17:29:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:41,424 INFO L225 Difference]: With dead ends: 106 [2018-12-03 17:29:41,424 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:29:41,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:29:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:29:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 17:29:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 17:29:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-03 17:29:41,429 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-03 17:29:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:41,430 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-03 17:29:41,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:29:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-03 17:29:41,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 17:29:41,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:41,430 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-03 17:29:41,431 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:41,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:41,431 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2018-12-03 17:29:41,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:41,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:41,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:41,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:41,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-03 17:29:42,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:42,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:42,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:42,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:42,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:42,299 INFO 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 17:29:42,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:42,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:42,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:42,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:42,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-03 17:29:42,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-03 17:29:43,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:43,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 17:29:43,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:43,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:29:43,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:29:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:29:43,723 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-03 17:29:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:43,915 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-12-03 17:29:43,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:29:43,915 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-03 17:29:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:43,916 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:29:43,917 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 17:29:43,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:29:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 17:29:43,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 17:29:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:29:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 17:29:43,920 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-12-03 17:29:43,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:43,920 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 17:29:43,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:29:43,920 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 17:29:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 17:29:43,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:43,921 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-03 17:29:43,921 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:43,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:43,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2018-12-03 17:29:43,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:43,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:43,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:43,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 17:29:44,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:44,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:44,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:44,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:44,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:44,943 INFO 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 17:29:44,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:44,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:45,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 17:29:45,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-03 17:29:46,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:46,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 17:29:46,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:46,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:29:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:29:46,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:29:46,509 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-03 17:29:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:46,707 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-03 17:29:46,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:29:46,707 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-03 17:29:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:46,708 INFO L225 Difference]: With dead ends: 112 [2018-12-03 17:29:46,708 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:29:46,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:29:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:29:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 17:29:46,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:29:46,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 17:29:46,712 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 17:29:46,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:46,713 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 17:29:46,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:29:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 17:29:46,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 17:29:46,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:46,714 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-03 17:29:46,714 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:46,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:46,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2018-12-03 17:29:46,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:46,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:46,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-03 17:29:47,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:47,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:47,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:47,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:47,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:47,325 INFO 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 17:29:47,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:47,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:47,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 17:29:47,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:47,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-03 17:29:47,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:49,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-03 17:29:49,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:49,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 17:29:49,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:49,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:29:49,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:29:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:29:49,201 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-03 17:29:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:49,347 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-03 17:29:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:29:49,348 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-03 17:29:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:49,349 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:29:49,349 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:29:49,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:29:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:29:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 17:29:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:29:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-03 17:29:49,352 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-03 17:29:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:49,352 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-03 17:29:49,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:29:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-03 17:29:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 17:29:49,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:49,353 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-03 17:29:49,353 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:49,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2018-12-03 17:29:49,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:49,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:49,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-03 17:29:50,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:50,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:50,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:50,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:50,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:50,293 INFO 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 17:29:50,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:50,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:50,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:50,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:50,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-03 17:29:50,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-03 17:29:52,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:52,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 17:29:52,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:52,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:29:52,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:29:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:29:52,188 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-03 17:29:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:52,345 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-12-03 17:29:52,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:29:52,346 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-03 17:29:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:52,347 INFO L225 Difference]: With dead ends: 118 [2018-12-03 17:29:52,347 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 17:29:52,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 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 17:29:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 17:29:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 17:29:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 17:29:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 17:29:52,351 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-03 17:29:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:52,351 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 17:29:52,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:29:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 17:29:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 17:29:52,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:52,352 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-03 17:29:52,352 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:52,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2018-12-03 17:29:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:52,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:52,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:52,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:53,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-03 17:29:53,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:53,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:53,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:53,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 17:29:53,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:53,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 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 17:29:53,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:53,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:29:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:53,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-03 17:29:53,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-03 17:29:55,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:55,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 17:29:55,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:55,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:29:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:29:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:29:55,052 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-03 17:29:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:55,198 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-12-03 17:29:55,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:29:55,199 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-03 17:29:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:55,200 INFO L225 Difference]: With dead ends: 121 [2018-12-03 17:29:55,200 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:29:55,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:29:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:29:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 17:29:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 17:29:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 17:29:55,203 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-03 17:29:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:55,203 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 17:29:55,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:29:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 17:29:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:29:55,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:55,204 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-03 17:29:55,204 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:55,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:55,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2018-12-03 17:29:55,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:55,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:55,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:29:55,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:55,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-03 17:29:55,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:55,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:55,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:55,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:55,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:55,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:29:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:29:55,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:29:56,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:29:56,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:56,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-03 17:29:56,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:29:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-03 17:29:58,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:29:58,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 17:29:58,345 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:29:58,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:29:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:29:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:29:58,347 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-03 17:29:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:29:58,497 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-12-03 17:29:58,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:29:58,497 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-03 17:29:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:29:58,498 INFO L225 Difference]: With dead ends: 124 [2018-12-03 17:29:58,498 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:29:58,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:29:58,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:29:58,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 17:29:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 17:29:58,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-03 17:29:58,502 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-03 17:29:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:29:58,502 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-03 17:29:58,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:29:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-03 17:29:58,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:29:58,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:29:58,503 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-03 17:29:58,503 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:29:58,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:29:58,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2018-12-03 17:29:58,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:29:58,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:58,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:29:58,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:29:58,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:29:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:29:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-03 17:29:59,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:59,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:29:59,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:29:59,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:29:59,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:29:59,354 INFO 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 17:29:59,362 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:29:59,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:29:59,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:29:59,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:29:59,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:29:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-03 17:29:59,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-03 17:30:01,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:01,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 17:30:01,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:01,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:30:01,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:30:01,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:30:01,609 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-03 17:30:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:01,769 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-12-03 17:30:01,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:30:01,770 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-03 17:30:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:01,771 INFO L225 Difference]: With dead ends: 127 [2018-12-03 17:30:01,771 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:30:01,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:30:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:30:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:30:01,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:30:01,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 17:30:01,776 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-03 17:30:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:01,776 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 17:30:01,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:30:01,777 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 17:30:01,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:30:01,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:01,777 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-03 17:30:01,777 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:01,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:01,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2018-12-03 17:30:01,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:01,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:01,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:01,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:01,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-03 17:30:02,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:02,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:02,807 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:02,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:02,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:02,807 INFO 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 17:30:02,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:02,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:02,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-03 17:30:02,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-03 17:30:04,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:04,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 17:30:04,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:04,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:30:04,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:30:04,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:30:04,736 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-03 17:30:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:04,977 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-03 17:30:04,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:30:04,977 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-03 17:30:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:04,978 INFO L225 Difference]: With dead ends: 130 [2018-12-03 17:30:04,978 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:30:04,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:30:04,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:30:04,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 17:30:04,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 17:30:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 17:30:04,982 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-03 17:30:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:04,982 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 17:30:04,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:30:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 17:30:04,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:30:04,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:04,983 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-03 17:30:04,983 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:04,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:04,983 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2018-12-03 17:30:04,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:04,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:04,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:04,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:04,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:05,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-03 17:30:05,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:05,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:05,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:05,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:05,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:05,804 INFO 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 17:30:05,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:05,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:06,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:30:06,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:06,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-03 17:30:06,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-03 17:30:08,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:08,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 17:30:08,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:08,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:30:08,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:30:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:30:08,142 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-03 17:30:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:08,329 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-03 17:30:08,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:30:08,329 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-03 17:30:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:08,330 INFO L225 Difference]: With dead ends: 133 [2018-12-03 17:30:08,330 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:30:08,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:30:08,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:30:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 17:30:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:30:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-03 17:30:08,335 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-12-03 17:30:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:08,335 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-03 17:30:08,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:30:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-03 17:30:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:30:08,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:08,336 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-03 17:30:08,336 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:08,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2018-12-03 17:30:08,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:08,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:08,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-03 17:30:11,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:11,059 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:11,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:11,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:11,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:11,060 INFO 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 17:30:11,068 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:11,068 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:11,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:11,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:11,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-03 17:30:11,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-03 17:30:13,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:13,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 17:30:13,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:13,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:30:13,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:30:13,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:30:13,345 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-03 17:30:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:13,519 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-12-03 17:30:13,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:30:13,520 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-03 17:30:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:13,520 INFO L225 Difference]: With dead ends: 136 [2018-12-03 17:30:13,521 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:30:13,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:30:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:30:13,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 17:30:13,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 17:30:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 17:30:13,525 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-03 17:30:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:13,525 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 17:30:13,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:30:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 17:30:13,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:30:13,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:13,526 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-03 17:30:13,526 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:13,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:13,527 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2018-12-03 17:30:13,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:13,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:13,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:13,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-03 17:30:14,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:14,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:14,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:14,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:14,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:14,493 INFO 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 17:30:14,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:14,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:14,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-03 17:30:14,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-03 17:30:17,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:17,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 17:30:17,048 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:17,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:30:17,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:30:17,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:30:17,050 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-03 17:30:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:17,288 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-12-03 17:30:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:30:17,288 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-03 17:30:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:17,289 INFO L225 Difference]: With dead ends: 139 [2018-12-03 17:30:17,289 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:30:17,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:30:17,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:30:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 17:30:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:30:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 17:30:17,293 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 17:30:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:17,293 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 17:30:17,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:30:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 17:30:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:30:17,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:17,294 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-03 17:30:17,294 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:17,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2018-12-03 17:30:17,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:17,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:17,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:17,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 17:30:20,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:20,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:20,700 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:20,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:20,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:20,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 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 17:30:20,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:20,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:21,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 17:30:21,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:21,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 17:30:21,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-03 17:30:23,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:23,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 17:30:23,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:23,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:30:23,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:30:23,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:30:23,482 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-03 17:30:24,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:24,584 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-12-03 17:30:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:30:24,584 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-03 17:30:24,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:24,585 INFO L225 Difference]: With dead ends: 142 [2018-12-03 17:30:24,585 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:30:24,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:30:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:30:24,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 17:30:24,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 17:30:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-03 17:30:24,589 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-03 17:30:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:24,589 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-03 17:30:24,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:30:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-03 17:30:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 17:30:24,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:24,590 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-03 17:30:24,591 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:24,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2018-12-03 17:30:24,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:24,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:24,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-03 17:30:25,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:25,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:25,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:25,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:25,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:25,895 INFO 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 17:30:25,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:25,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:25,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:25,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:25,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-03 17:30:25,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-03 17:30:29,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:29,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 17:30:29,483 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:29,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:30:29,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:30:29,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:30:29,485 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-03 17:30:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:29,720 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-03 17:30:29,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:30:29,727 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-03 17:30:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:29,727 INFO L225 Difference]: With dead ends: 145 [2018-12-03 17:30:29,728 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:30:29,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:30:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:30:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 17:30:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 17:30:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 17:30:29,732 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-12-03 17:30:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:29,732 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 17:30:29,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:30:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 17:30:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:30:29,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:29,733 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-03 17:30:29,734 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:29,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:29,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2018-12-03 17:30:29,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:29,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:29,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:29,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-03 17:30:31,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:31,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:31,560 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:31,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:31,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:31,560 INFO 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 17:30:31,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:31,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:31,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-03 17:30:31,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-03 17:30:34,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:34,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 17:30:34,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:34,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:30:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:30:34,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:30:34,154 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-03 17:30:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:34,337 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-12-03 17:30:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:30:34,337 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-03 17:30:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:34,339 INFO L225 Difference]: With dead ends: 148 [2018-12-03 17:30:34,339 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:30:34,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:30:34,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:30:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 17:30:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 17:30:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 17:30:34,344 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 17:30:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:34,344 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 17:30:34,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:30:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 17:30:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:30:34,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:34,345 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-03 17:30:34,345 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:34,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2018-12-03 17:30:34,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:34,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:34,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-03 17:30:36,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:36,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:36,017 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:36,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:36,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:36,017 INFO 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 17:30:36,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:36,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:36,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 17:30:36,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:36,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-03 17:30:36,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-03 17:30:39,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:39,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 17:30:39,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:39,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:30:39,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:30:39,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:30:39,715 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-03 17:30:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:39,911 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-12-03 17:30:39,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:30:39,911 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-03 17:30:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:39,912 INFO L225 Difference]: With dead ends: 151 [2018-12-03 17:30:39,912 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:30:39,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:30:39,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:30:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 17:30:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 17:30:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-03 17:30:39,916 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-03 17:30:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:39,916 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-03 17:30:39,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:30:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-03 17:30:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:30:39,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:39,917 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-03 17:30:39,917 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:39,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:39,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2018-12-03 17:30:39,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:39,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:39,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:39,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:39,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-03 17:30:41,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:41,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:41,657 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:41,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:41,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:41,657 INFO 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 17:30:41,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:41,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:41,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:41,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:41,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:41,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-03 17:30:41,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:44,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-03 17:30:44,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:44,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 17:30:44,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:44,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:30:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:30:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:30:44,356 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-03 17:30:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:44,696 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-12-03 17:30:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:30:44,696 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-03 17:30:44,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:44,697 INFO L225 Difference]: With dead ends: 154 [2018-12-03 17:30:44,697 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 17:30:44,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:30:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 17:30:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 17:30:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 17:30:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 17:30:44,702 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-03 17:30:44,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:44,702 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 17:30:44,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:30:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 17:30:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 17:30:44,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:44,703 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-03 17:30:44,703 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:44,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:44,703 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2018-12-03 17:30:44,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:44,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:44,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:44,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:44,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-03 17:30:46,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:46,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:46,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:46,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:46,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:46,199 INFO 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 17:30:46,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:46,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:30:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:46,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:46,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-03 17:30:46,309 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-03 17:30:49,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:49,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 17:30:49,221 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:49,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:30:49,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:30:49,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:30:49,223 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-03 17:30:49,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:49,474 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-12-03 17:30:49,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:30:49,475 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-03 17:30:49,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:49,475 INFO L225 Difference]: With dead ends: 157 [2018-12-03 17:30:49,475 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:30:49,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:30:49,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:30:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 17:30:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 17:30:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 17:30:49,480 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-03 17:30:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:49,480 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 17:30:49,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:30:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 17:30:49,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:30:49,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:49,481 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-03 17:30:49,482 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:49,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2018-12-03 17:30:49,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:49,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:30:49,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:49,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-03 17:30:50,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:50,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:50,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:50,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 17:30:50,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:50,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 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 17:30:50,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:30:50,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:30:52,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:30:52,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:52,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-03 17:30:52,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:30:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-03 17:30:54,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:30:54,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 17:30:54,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:30:54,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:30:54,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:30:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:30:54,960 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-03 17:30:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:30:56,060 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-03 17:30:56,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:30:56,061 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-03 17:30:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:30:56,062 INFO L225 Difference]: With dead ends: 160 [2018-12-03 17:30:56,062 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:30:56,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 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 17:30:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:30:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 17:30:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:30:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-03 17:30:56,067 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-03 17:30:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:30:56,067 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-03 17:30:56,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:30:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-03 17:30:56,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:30:56,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:30:56,068 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-03 17:30:56,069 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:30:56,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:30:56,069 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2018-12-03 17:30:56,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:30:56,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:56,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:30:56,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:30:56,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:30:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:30:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-03 17:30:57,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:57,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:30:57,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:30:57,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:30:57,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:30:57,303 INFO 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 17:30:57,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:30:57,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:30:57,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:30:57,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:30:57,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:30:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-03 17:30:57,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-03 17:31:00,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:00,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 17:31:00,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:00,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:31:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:31:00,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:31:00,584 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-03 17:31:00,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:00,865 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-12-03 17:31:00,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:31:00,865 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-03 17:31:00,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:00,866 INFO L225 Difference]: With dead ends: 163 [2018-12-03 17:31:00,866 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:31:00,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:31:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:31:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:31:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:31:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 17:31:00,872 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-03 17:31:00,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:00,872 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 17:31:00,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:31:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 17:31:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:31:00,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:00,874 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-03 17:31:00,874 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:00,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:00,874 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2018-12-03 17:31:00,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:00,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:00,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:00,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-03 17:31:02,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:02,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:02,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:02,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:02,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:02,539 INFO 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 17:31:02,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:02,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:02,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-03 17:31:02,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-03 17:31:05,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:05,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 17:31:05,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:05,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:31:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:31:05,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:31:05,669 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-03 17:31:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:05,934 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-12-03 17:31:05,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:31:05,934 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-03 17:31:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:05,935 INFO L225 Difference]: With dead ends: 166 [2018-12-03 17:31:05,935 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:31:05,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:31:05,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:31:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 17:31:05,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 17:31:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 17:31:05,939 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-03 17:31:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:05,939 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 17:31:05,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:31:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 17:31:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 17:31:05,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:05,939 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-03 17:31:05,940 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:05,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2018-12-03 17:31:05,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:05,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:05,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-03 17:31:07,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:07,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:07,520 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:07,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:07,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:07,520 INFO 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 17:31:07,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:07,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:08,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:31:08,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:08,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:08,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-03 17:31:08,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-03 17:31:12,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:12,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 17:31:12,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:12,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:31:12,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:31:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:31:12,300 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-12-03 17:31:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:12,588 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-12-03 17:31:12,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:31:12,588 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-03 17:31:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:12,589 INFO L225 Difference]: With dead ends: 169 [2018-12-03 17:31:12,589 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:31:12,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:31:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:31:12,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 17:31:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:31:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-03 17:31:12,593 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-12-03 17:31:12,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:12,594 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-03 17:31:12,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:31:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-03 17:31:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:31:12,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:12,595 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2018-12-03 17:31:12,595 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:12,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2018-12-03 17:31:12,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:12,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:12,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:12,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:12,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 17:31:14,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:14,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:14,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:14,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:14,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:14,054 INFO 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 17:31:14,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:14,063 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:14,146 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:14,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:14,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 17:31:14,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-03 17:31:17,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:17,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 17:31:17,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:17,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:31:17,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:31:17,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:31:17,720 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-12-03 17:31:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:17,951 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-12-03 17:31:17,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:31:17,952 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-03 17:31:17,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:17,952 INFO L225 Difference]: With dead ends: 172 [2018-12-03 17:31:17,953 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 17:31:17,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:31:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 17:31:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 17:31:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:31:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 17:31:17,957 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-12-03 17:31:17,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:17,958 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 17:31:17,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:31:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 17:31:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 17:31:17,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:17,959 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2018-12-03 17:31:17,959 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:17,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2018-12-03 17:31:17,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:17,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:17,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 17:31:19,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:19,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:19,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:19,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:19,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:19,204 INFO 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 17:31:19,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:19,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:19,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 17:31:19,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-03 17:31:23,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:23,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 17:31:23,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:23,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:31:23,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:31:23,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:31:23,365 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-12-03 17:31:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:23,834 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-12-03 17:31:23,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:31:23,835 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-03 17:31:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:23,835 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:31:23,836 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 17:31:23,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:31:23,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 17:31:23,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 17:31:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 17:31:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 17:31:23,841 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 17:31:23,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:23,841 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 17:31:23,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:31:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 17:31:23,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 17:31:23,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:23,842 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2018-12-03 17:31:23,842 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:23,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:23,843 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2018-12-03 17:31:23,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:23,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:23,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:23,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:23,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-03 17:31:25,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:25,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:25,113 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:25,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:25,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:25,113 INFO 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 17:31:25,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:25,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:26,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 17:31:26,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:26,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-03 17:31:26,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-03 17:31:30,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:30,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 17:31:30,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:30,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:31:30,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:31:30,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:31:30,352 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-12-03 17:31:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:30,688 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-12-03 17:31:30,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:31:30,689 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-03 17:31:30,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:30,690 INFO L225 Difference]: With dead ends: 178 [2018-12-03 17:31:30,690 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 17:31:30,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:31:30,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 17:31:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 17:31:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 17:31:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-12-03 17:31:30,693 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-12-03 17:31:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:30,694 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-12-03 17:31:30,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:31:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-12-03 17:31:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 17:31:30,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:30,695 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2018-12-03 17:31:30,695 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:30,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:30,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2018-12-03 17:31:30,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:30,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:30,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:30,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:30,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-03 17:31:32,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:32,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:32,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:32,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:32,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:32,390 INFO 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 17:31:32,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:32,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:32,483 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:32,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:32,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-03 17:31:32,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-03 17:31:36,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:36,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 17:31:36,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:36,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:31:36,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:31:36,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:31:36,162 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-12-03 17:31:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:36,472 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-12-03 17:31:36,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:31:36,472 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-03 17:31:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:36,473 INFO L225 Difference]: With dead ends: 181 [2018-12-03 17:31:36,473 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 17:31:36,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:31:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 17:31:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 17:31:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 17:31:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 17:31:36,480 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-12-03 17:31:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:36,480 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 17:31:36,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:31:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 17:31:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 17:31:36,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:36,481 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2018-12-03 17:31:36,481 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:36,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2018-12-03 17:31:36,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:36,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:36,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:36,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:36,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-03 17:31:38,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:38,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:38,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:38,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:38,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:38,088 INFO 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 17:31:38,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:38,099 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:38,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-03 17:31:38,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:41,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-03 17:31:42,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:42,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 17:31:42,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:42,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:31:42,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:31:42,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:31:42,017 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-12-03 17:31:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:42,426 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-12-03 17:31:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:31:42,427 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-03 17:31:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:42,427 INFO L225 Difference]: With dead ends: 184 [2018-12-03 17:31:42,427 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 17:31:42,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:31:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 17:31:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 17:31:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 17:31:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 17:31:42,433 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 17:31:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:42,433 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 17:31:42,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:31:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 17:31:42,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 17:31:42,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:42,434 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2018-12-03 17:31:42,434 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:42,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:42,435 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2018-12-03 17:31:42,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:42,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:42,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:42,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:42,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:43,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-03 17:31:43,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:43,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:43,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:43,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:43,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:43,860 INFO 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 17:31:43,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:43,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:45,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 17:31:45,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:45,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-03 17:31:45,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-03 17:31:49,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:49,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 17:31:49,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:49,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:31:49,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:31:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:31:49,364 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-12-03 17:31:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:49,700 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-12-03 17:31:49,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:31:49,701 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-03 17:31:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:49,702 INFO L225 Difference]: With dead ends: 187 [2018-12-03 17:31:49,702 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 17:31:49,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:31:49,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 17:31:49,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 17:31:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 17:31:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-03 17:31:49,706 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-12-03 17:31:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:49,706 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-03 17:31:49,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:31:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-03 17:31:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 17:31:49,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:49,708 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2018-12-03 17:31:49,708 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:49,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:49,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2018-12-03 17:31:49,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:49,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:49,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:49,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:51,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-03 17:31:51,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:51,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:51,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:51,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:51,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:51,170 INFO 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 17:31:51,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:51,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:51,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:51,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:51,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-03 17:31:51,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-03 17:31:55,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:55,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 17:31:55,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:55,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:31:55,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:31:55,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:31:55,602 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-12-03 17:31:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:55,911 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-12-03 17:31:55,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:31:55,911 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-03 17:31:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:55,912 INFO L225 Difference]: With dead ends: 190 [2018-12-03 17:31:55,913 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 17:31:55,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:31:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 17:31:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 17:31:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 17:31:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 17:31:55,918 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-12-03 17:31:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:55,918 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 17:31:55,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:31:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 17:31:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 17:31:55,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:55,919 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2018-12-03 17:31:55,919 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:55,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:55,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2018-12-03 17:31:55,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:55,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:55,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:55,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:55,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-03 17:31:57,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:57,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:57,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:57,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:57,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:57,331 INFO 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 17:31:57,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:57,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:57,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-03 17:31:57,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-03 17:32:01,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:01,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 17:32:01,778 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:01,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:32:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:32:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:32:01,780 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-12-03 17:32:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:02,164 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2018-12-03 17:32:02,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:32:02,164 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-03 17:32:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:02,165 INFO L225 Difference]: With dead ends: 193 [2018-12-03 17:32:02,165 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 17:32:02,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:32:02,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 17:32:02,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-03 17:32:02,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 17:32:02,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 17:32:02,170 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-03 17:32:02,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:02,170 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 17:32:02,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:32:02,171 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 17:32:02,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 17:32:02,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:02,171 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2018-12-03 17:32:02,172 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:02,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2018-12-03 17:32:02,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:02,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:02,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-03 17:32:04,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:04,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:04,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:04,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:04,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:04,001 INFO 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 17:32:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:04,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:05,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:32:05,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:05,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-03 17:32:05,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-03 17:32:09,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:09,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 17:32:09,651 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:09,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:32:09,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:32:09,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:32:09,654 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-12-03 17:32:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:10,080 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-12-03 17:32:10,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:32:10,081 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-03 17:32:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:10,081 INFO L225 Difference]: With dead ends: 196 [2018-12-03 17:32:10,082 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 17:32:10,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 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 17:32:10,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 17:32:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 17:32:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 17:32:10,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-03 17:32:10,086 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-12-03 17:32:10,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:10,086 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-03 17:32:10,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:32:10,087 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-03 17:32:10,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 17:32:10,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:10,087 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2018-12-03 17:32:10,087 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:10,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2018-12-03 17:32:10,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:10,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:10,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:10,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:10,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-03 17:32:11,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:11,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:11,691 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:11,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 17:32:11,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:11,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 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 17:32:11,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:11,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:11,798 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:11,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:11,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-03 17:32:11,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-03 17:32:16,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:16,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 17:32:16,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:16,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:32:16,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:32:16,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:32:16,485 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-12-03 17:32:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:16,924 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-12-03 17:32:16,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:32:16,925 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-03 17:32:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:16,925 INFO L225 Difference]: With dead ends: 199 [2018-12-03 17:32:16,926 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 17:32:16,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 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 17:32:16,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 17:32:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 17:32:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 17:32:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 17:32:16,931 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-12-03 17:32:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:16,931 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 17:32:16,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:32:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 17:32:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 17:32:16,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:16,932 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2018-12-03 17:32:16,932 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:16,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2018-12-03 17:32:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:16,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:16,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-03 17:32:18,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:18,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:18,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:18,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:18,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:18,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:32:18,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:18,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:19,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-03 17:32:19,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:24,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-03 17:32:24,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:24,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 17:32:24,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:24,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:32:24,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:32:24,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:32:24,803 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-12-03 17:32:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:25,267 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-12-03 17:32:25,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:32:25,267 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-03 17:32:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:25,268 INFO L225 Difference]: With dead ends: 202 [2018-12-03 17:32:25,268 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 17:32:25,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:32:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 17:32:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 17:32:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 17:32:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 17:32:25,273 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-03 17:32:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 17:32:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:32:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 17:32:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 17:32:25,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:25,275 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2018-12-03 17:32:25,275 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:25,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:25,275 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2018-12-03 17:32:25,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:25,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:25,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:25,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 17:32:26,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:26,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:26,984 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:26,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:26,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:26,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:32:26,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:26,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:30,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:32:30,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:30,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 17:32:30,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-03 17:32:35,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:35,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 17:32:35,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:35,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:32:35,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:32:35,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:32:35,400 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-12-03 17:32:35,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:35,801 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2018-12-03 17:32:35,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:32:35,802 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-03 17:32:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:35,802 INFO L225 Difference]: With dead ends: 205 [2018-12-03 17:32:35,803 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 17:32:35,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:32:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 17:32:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-03 17:32:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 17:32:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-03 17:32:35,808 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-12-03 17:32:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:35,808 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-03 17:32:35,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:32:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-03 17:32:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 17:32:35,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:35,809 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2018-12-03 17:32:35,809 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:35,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:35,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2018-12-03 17:32:35,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:35,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:35,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:35,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-03 17:32:38,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:38,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:38,257 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:38,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:38,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:38,258 INFO 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 17:32:38,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:38,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:38,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:38,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:38,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-03 17:32:38,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-03 17:32:43,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:43,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 17:32:43,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:43,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:32:43,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:32:43,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:32:43,409 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-12-03 17:32:43,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:43,994 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2018-12-03 17:32:43,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:32:43,995 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-03 17:32:43,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:43,995 INFO L225 Difference]: With dead ends: 208 [2018-12-03 17:32:43,995 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 17:32:43,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:32:43,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 17:32:43,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 17:32:43,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 17:32:44,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 17:32:44,000 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-12-03 17:32:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:44,000 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 17:32:44,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:32:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 17:32:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 17:32:44,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:44,001 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2018-12-03 17:32:44,001 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:44,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2018-12-03 17:32:44,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:44,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:44,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-03 17:32:45,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:45,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:45,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32: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 17:32:45,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32: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 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 17:32:45,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:45,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:45,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-03 17:32:45,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-03 17:32:51,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:51,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 17:32:51,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:51,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:32:51,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:32:51,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:32:51,224 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-12-03 17:32:51,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:51,741 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-12-03 17:32:51,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:32:51,741 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-03 17:32:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:51,742 INFO L225 Difference]: With dead ends: 211 [2018-12-03 17:32:51,742 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 17:32:51,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 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 17:32:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 17:32:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 17:32:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 17:32:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 17:32:51,747 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 17:32:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:51,747 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 17:32:51,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:32:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 17:32:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 17:32:51,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:51,748 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2018-12-03 17:32:51,748 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:51,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:51,749 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2018-12-03 17:32:51,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:51,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:51,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:51,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:51,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-03 17:32:53,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:53,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:53,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:53,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:53,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:53,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:32:53,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:53,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:57,258 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 17:32:57,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:57,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-03 17:32:57,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-03 17:33:02,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:02,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 17:33:02,618 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:02,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:33:02,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:33:02,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:33:02,621 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-12-03 17:33:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:03,151 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2018-12-03 17:33:03,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:33:03,151 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-03 17:33:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:03,152 INFO L225 Difference]: With dead ends: 214 [2018-12-03 17:33:03,152 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 17:33:03,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:33:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 17:33:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 17:33:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 17:33:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-12-03 17:33:03,156 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-12-03 17:33:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:03,156 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-12-03 17:33:03,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:33:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-12-03 17:33:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 17:33:03,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:03,157 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2018-12-03 17:33:03,157 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:03,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:03,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2018-12-03 17:33:03,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:03,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:03,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:03,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-03 17:33:05,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:05,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:05,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:05,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:05,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:05,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:33:05,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:05,427 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:05,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:05,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:05,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-03 17:33:05,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-03 17:33:11,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:11,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 17:33:11,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:11,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:33:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:33:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:33:11,009 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-12-03 17:33:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:11,538 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2018-12-03 17:33:11,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:33:11,539 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-03 17:33:11,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:11,539 INFO L225 Difference]: With dead ends: 217 [2018-12-03 17:33:11,540 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 17:33:11,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:33:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 17:33:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 17:33:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 17:33:11,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 17:33:11,544 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-12-03 17:33:11,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:11,545 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 17:33:11,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:33:11,545 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 17:33:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 17:33:11,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:11,546 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2018-12-03 17:33:11,546 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:11,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:11,546 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2018-12-03 17:33:11,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:11,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:11,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:11,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:11,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-03 17:33:13,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:13,379 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:13,379 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:13,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 17:33:13,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:13,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 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 17:33:13,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:13,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:13,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-03 17:33:13,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:19,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-03 17:33:19,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:19,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 17:33:19,339 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:19,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:33:19,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:33:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:33:19,342 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-12-03 17:33:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:19,843 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-12-03 17:33:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:33:19,843 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-03 17:33:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:19,844 INFO L225 Difference]: With dead ends: 220 [2018-12-03 17:33:19,845 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 17:33:19,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:33:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 17:33:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 17:33:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 17:33:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 17:33:19,849 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 17:33:19,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:19,850 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 17:33:19,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:33:19,850 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 17:33:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 17:33:19,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:19,851 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2018-12-03 17:33:19,851 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:19,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2018-12-03 17:33:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:19,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:19,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-03 17:33:21,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:21,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:21,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:21,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:21,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:21,847 INFO 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 17:33:21,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:21,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:24,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 17:33:24,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:24,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:24,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-03 17:33:24,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-03 17:33:30,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:30,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 17:33:30,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:30,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:33:30,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:33:30,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:33:30,761 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-12-03 17:33:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:31,354 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2018-12-03 17:33:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:33:31,354 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-03 17:33:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:31,355 INFO L225 Difference]: With dead ends: 223 [2018-12-03 17:33:31,355 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 17:33:31,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 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 17:33:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 17:33:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 17:33:31,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 17:33:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-03 17:33:31,360 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-12-03 17:33:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:31,360 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-03 17:33:31,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:33:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-03 17:33:31,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 17:33:31,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:31,362 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2018-12-03 17:33:31,362 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:31,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:31,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2018-12-03 17:33:31,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:31,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:31,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:31,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:31,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-03 17:33:33,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:33,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:33,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:33,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:33,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:33,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:33:33,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:33,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:33,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:33,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:33,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-03 17:33:33,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-03 17:33:39,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:39,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 17:33:39,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:39,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:33:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:33:39,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:33:39,766 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-12-03 17:33:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:40,349 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-12-03 17:33:40,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:33:40,350 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-03 17:33:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:40,350 INFO L225 Difference]: With dead ends: 226 [2018-12-03 17:33:40,350 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 17:33:40,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:33:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 17:33:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 17:33:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 17:33:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 17:33:40,357 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-12-03 17:33:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:40,358 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 17:33:40,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:33:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 17:33:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 17:33:40,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:40,359 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2018-12-03 17:33:40,359 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:40,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:40,360 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2018-12-03 17:33:40,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:40,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:40,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:40,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:40,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-03 17:33:42,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:42,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:42,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:42,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:42,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:42,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:33:42,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:42,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:42,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-03 17:33:42,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-03 17:33:48,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:48,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 17:33:48,885 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:48,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:33:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:33:48,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:33:48,887 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-12-03 17:33:49,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:49,425 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2018-12-03 17:33:49,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:33:49,426 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-03 17:33:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:49,427 INFO L225 Difference]: With dead ends: 229 [2018-12-03 17:33:49,427 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 17:33:49,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:33:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 17:33:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 17:33:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 17:33:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 17:33:49,432 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-03 17:33:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:49,432 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 17:33:49,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:33:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 17:33:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 17:33:49,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:49,433 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2018-12-03 17:33:49,433 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:49,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2018-12-03 17:33:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:49,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:49,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-03 17:33:51,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:51,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:51,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:51,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:51,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:51,955 INFO 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 17:33:51,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:51,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:54,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:33:54,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:54,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-03 17:33:54,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-03 17:34:01,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:01,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 17:34:01,108 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:01,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:34:01,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:34:01,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:34:01,110 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-12-03 17:34:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:01,732 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2018-12-03 17:34:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:34:01,732 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-03 17:34:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:01,733 INFO L225 Difference]: With dead ends: 232 [2018-12-03 17:34:01,733 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 17:34:01,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:34:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 17:34:01,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 17:34:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 17:34:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-03 17:34:01,737 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-12-03 17:34:01,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:01,737 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-03 17:34:01,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:34:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-03 17:34:01,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 17:34:01,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:01,738 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2018-12-03 17:34:01,738 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:01,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:01,738 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2018-12-03 17:34:01,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:01,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:01,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:01,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:01,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:03,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-03 17:34:03,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:03,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:03,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:03,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:03,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:03,895 INFO 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 17:34:03,903 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:03,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:04,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:04,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:04,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:04,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-03 17:34:04,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:10,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-03 17:34:10,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:10,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 17:34:10,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:10,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:34:10,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:34:10,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:34:10,544 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-12-03 17:34:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:11,288 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-12-03 17:34:11,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:34:11,289 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-03 17:34:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:11,290 INFO L225 Difference]: With dead ends: 235 [2018-12-03 17:34:11,290 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 17:34:11,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:34:11,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 17:34:11,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 17:34:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 17:34:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 17:34:11,295 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-12-03 17:34:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:11,295 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 17:34:11,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:34:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 17:34:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 17:34:11,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:11,296 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2018-12-03 17:34:11,296 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:11,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2018-12-03 17:34:11,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:11,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:11,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:11,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:11,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-03 17:34:13,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:13,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:13,489 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:13,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:13,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:13,489 INFO 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 17:34:13,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:13,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:13,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-03 17:34:13,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-03 17:34:20,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:20,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 17:34:20,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:20,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:34:20,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:34:20,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:34:20,322 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-12-03 17:34:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:20,931 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-12-03 17:34:20,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:34:20,931 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-03 17:34:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:20,932 INFO L225 Difference]: With dead ends: 238 [2018-12-03 17:34:20,932 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 17:34:20,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:34:20,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 17:34:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 17:34:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 17:34:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 17:34:20,936 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-03 17:34:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:20,938 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 17:34:20,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:34:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 17:34:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 17:34:20,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:20,939 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2018-12-03 17:34:20,939 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:20,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:20,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2018-12-03 17:34:20,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:20,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:20,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:20,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:20,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-03 17:34:23,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:23,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:23,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:23,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:23,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:23,256 INFO 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 17:34:23,264 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:23,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:28,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:34:28,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:28,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-03 17:34:28,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-03 17:34:35,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:35,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 17:34:35,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:35,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:34:35,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:34:35,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:34:35,305 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-12-03 17:34:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:36,042 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-12-03 17:34:36,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:34:36,043 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-03 17:34:36,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:36,044 INFO L225 Difference]: With dead ends: 241 [2018-12-03 17:34:36,044 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 17:34:36,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 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 17:34:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 17:34:36,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 17:34:36,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 17:34:36,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-03 17:34:36,050 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-12-03 17:34:36,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:36,050 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-03 17:34:36,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:34:36,050 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-03 17:34:36,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 17:34:36,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:36,051 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2018-12-03 17:34:36,052 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:36,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:36,052 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2018-12-03 17:34:36,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:36,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:36,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:36,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:36,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:36,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-03 17:34:38,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:38,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:38,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:38,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 17:34:38,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:38,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 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 17:34:38,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:38,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:38,764 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:38,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:38,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-03 17:34:38,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:45,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-03 17:34:45,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:45,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 17:34:45,651 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:45,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:34:45,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:34:45,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:34:45,653 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-12-03 17:34:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:46,474 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2018-12-03 17:34:46,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:34:46,474 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-03 17:34:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:46,475 INFO L225 Difference]: With dead ends: 244 [2018-12-03 17:34:46,475 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 17:34:46,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 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 17:34:46,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 17:34:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 17:34:46,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 17:34:46,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 17:34:46,480 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-12-03 17:34:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:46,481 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 17:34:46,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:34:46,481 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 17:34:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 17:34:46,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:46,482 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2018-12-03 17:34:46,482 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:46,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2018-12-03 17:34:46,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:46,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:46,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-03 17:34:48,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:48,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:48,914 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:48,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:48,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:48,914 INFO 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 17:34:48,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:48,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:49,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-03 17:34:49,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-03 17:34:56,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:56,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 17:34:56,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:56,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 17:34:56,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 17:34:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:34:56,352 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-12-03 17:34:57,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:57,171 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2018-12-03 17:34:57,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:34:57,171 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-12-03 17:34:57,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:57,172 INFO L225 Difference]: With dead ends: 247 [2018-12-03 17:34:57,172 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 17:34:57,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:34:57,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 17:34:57,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 17:34:57,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 17:34:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 17:34:57,176 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 17:34:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:57,176 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 17:34:57,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 17:34:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 17:34:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 17:34:57,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:57,177 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2018-12-03 17:34:57,177 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:57,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2018-12-03 17:34:57,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:57,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:57,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-03 17:34:59,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:59,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:59,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:59,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:59,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:59,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:34:59,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:59,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:03,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 17:35:03,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:03,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-03 17:35:03,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-03 17:35:10,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:10,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 17:35:10,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:10,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:35:10,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:35:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:35:10,425 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2018-12-03 17:35:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:11,259 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-12-03 17:35:11,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:35:11,259 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-12-03 17:35:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:11,260 INFO L225 Difference]: With dead ends: 250 [2018-12-03 17:35:11,260 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 17:35:11,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:35:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 17:35:11,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-03 17:35:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 17:35:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-12-03 17:35:11,265 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-12-03 17:35:11,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:11,265 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-12-03 17:35:11,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:35:11,265 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-12-03 17:35:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 17:35:11,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:11,266 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2018-12-03 17:35:11,266 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:11,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2018-12-03 17:35:11,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:11,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:11,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-03 17:35:14,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:14,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:14,263 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:14,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:14,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:14,263 INFO 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 17:35:14,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:14,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:14,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:14,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:14,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-03 17:35:14,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-03 17:35:21,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:21,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:35:21,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:21,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:35:21,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:35:21,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:35:21,817 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-12-03 17:35:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:22,501 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2018-12-03 17:35:22,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:35:22,501 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-12-03 17:35:22,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:22,502 INFO L225 Difference]: With dead ends: 253 [2018-12-03 17:35:22,502 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 17:35:22,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:35:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 17:35:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 17:35:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 17:35:22,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 17:35:22,507 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-12-03 17:35:22,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:22,507 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 17:35:22,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:35:22,507 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 17:35:22,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 17:35:22,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:22,508 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2018-12-03 17:35:22,508 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:22,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2018-12-03 17:35:22,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:22,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:22,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:22,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:25,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-03 17:35:25,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:25,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:25,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:25,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:25,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:25,136 INFO 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 17:35:25,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:25,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:35:25,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:25,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-03 17:35:25,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-03 17:35:33,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:33,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:35:33,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:33,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:35:33,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:35:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:35:33,191 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2018-12-03 17:35:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:34,060 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2018-12-03 17:35:34,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:35:34,060 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-12-03 17:35:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:34,061 INFO L225 Difference]: With dead ends: 256 [2018-12-03 17:35:34,061 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 17:35:34,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 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 17:35:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 17:35:34,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 17:35:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 17:35:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 17:35:34,065 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 17:35:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:34,065 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 17:35:34,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:35:34,065 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 17:35:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 17:35:34,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:34,066 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2018-12-03 17:35:34,066 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:34,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:34,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2018-12-03 17:35:34,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:34,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:36,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-03 17:35:36,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:36,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:36,706 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:36,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:36,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:36,706 INFO 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 17:35:36,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:36,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:46,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 17:35:46,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:46,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-03 17:35:47,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-03 17:35:55,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:55,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:35:55,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:55,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:35:55,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:35:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:35:55,192 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-12-03 17:35:56,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:56,152 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2018-12-03 17:35:56,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:35:56,152 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-12-03 17:35:56,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:56,153 INFO L225 Difference]: With dead ends: 259 [2018-12-03 17:35:56,153 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 17:35:56,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 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 17:35:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 17:35:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-03 17:35:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 17:35:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-12-03 17:35:56,158 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-12-03 17:35:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:56,158 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-12-03 17:35:56,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:35:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-12-03 17:35:56,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 17:35:56,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:56,159 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2018-12-03 17:35:56,159 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:56,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:56,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2018-12-03 17:35:56,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:56,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:56,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:56,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-03 17:35:59,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:59,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:59,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:59,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:59,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:59,098 INFO 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 17:35:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:59,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:59,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:59,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:59,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-03 17:35:59,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:07,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-03 17:36:07,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:07,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:36:07,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:07,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:36:07,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:36:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:36:07,274 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2018-12-03 17:36:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:08,274 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2018-12-03 17:36:08,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:36:08,274 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-12-03 17:36:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:08,275 INFO L225 Difference]: With dead ends: 262 [2018-12-03 17:36:08,275 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 17:36:08,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:36:08,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 17:36:08,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 17:36:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 17:36:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-03 17:36:08,280 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-12-03 17:36:08,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:08,281 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-03 17:36:08,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:36:08,281 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-03 17:36:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 17:36:08,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:08,282 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2018-12-03 17:36:08,283 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:08,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:08,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2018-12-03 17:36:08,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:08,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:08,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:08,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-03 17:36:11,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:11,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:11,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:11,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:11,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:11,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 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 17:36:11,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:11,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:36:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:11,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-03 17:36:11,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-03 17:36:19,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:19,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:36:19,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:19,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:36:19,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:36:19,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:36:19,798 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-12-03 17:36:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:20,779 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-12-03 17:36:20,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:36:20,780 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-12-03 17:36:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:20,781 INFO L225 Difference]: With dead ends: 265 [2018-12-03 17:36:20,781 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 17:36:20,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:36:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 17:36:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-03 17:36:20,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 17:36:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 17:36:20,785 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-03 17:36:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:20,786 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 17:36:20,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:36:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 17:36:20,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 17:36:20,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:20,787 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2018-12-03 17:36:20,787 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:20,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:20,788 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2018-12-03 17:36:20,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:20,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:20,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-03 17:36:23,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:23,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:23,688 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:23,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:23,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:23,688 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:36:23,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:23,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:34,439 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 17:36:34,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:34,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-03 17:36:34,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-03 17:36:42,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:42,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 17:36:42,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:42,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:36:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:36:42,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:36:42,881 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2018-12-03 17:36:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:43,741 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2018-12-03 17:36:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:36:43,741 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-12-03 17:36:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:43,742 INFO L225 Difference]: With dead ends: 268 [2018-12-03 17:36:43,742 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 17:36:43,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 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 17:36:43,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 17:36:43,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 17:36:43,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 17:36:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-12-03 17:36:43,747 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-12-03 17:36:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:43,747 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-12-03 17:36:43,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:36:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-12-03 17:36:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 17:36:43,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:43,748 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2018-12-03 17:36:43,748 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:43,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2018-12-03 17:36:43,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:43,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:43,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:43,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:43,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-03 17:36:46,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:46,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:46,923 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:46,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:46,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:46,924 INFO 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 17:36:46,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:46,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:47,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:47,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:47,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-03 17:36:47,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:55,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-03 17:36:56,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:56,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:36:56,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:56,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:36:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:36:56,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:36:56,015 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-12-03 17:36:57,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:57,067 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2018-12-03 17:36:57,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:36:57,068 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-12-03 17:36:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:57,069 INFO L225 Difference]: With dead ends: 271 [2018-12-03 17:36:57,069 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 17:36:57,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:36:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 17:36:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 17:36:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 17:36:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 17:36:57,073 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-12-03 17:36:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:57,073 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 17:36:57,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:36:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 17:36:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 17:36:57,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:57,074 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2018-12-03 17:36:57,074 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:57,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2018-12-03 17:36:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:57,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:57,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-03 17:37:00,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:00,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:00,201 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:00,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:00,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:00,201 INFO 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 17:37:00,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:00,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:00,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-03 17:37:00,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-03 17:37:09,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:37:09,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:09,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:37:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:37:09,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:37:09,142 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2018-12-03 17:37:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:09,988 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2018-12-03 17:37:09,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:37:09,989 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-12-03 17:37:09,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:09,989 INFO L225 Difference]: With dead ends: 274 [2018-12-03 17:37:09,989 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 17:37:09,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:37:09,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 17:37:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-03 17:37:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 17:37:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-03 17:37:10,021 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-03 17:37:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:10,022 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-03 17:37:10,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:37:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-03 17:37:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 17:37:10,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:10,023 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2018-12-03 17:37:10,023 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:10,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:10,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2018-12-03 17:37:10,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:10,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:10,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:10,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:10,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-03 17:37:13,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:13,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:13,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:13,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 17:37:13,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:13,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 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 17:37:13,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:37:13,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:37:18,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 17:37:18,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:18,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-03 17:37:18,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-03 17:37:27,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:27,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 17:37:27,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:27,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:37:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:37:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:37:27,937 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-12-03 17:37:28,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:28,795 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2018-12-03 17:37:28,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:37:28,796 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-12-03 17:37:28,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:28,797 INFO L225 Difference]: With dead ends: 277 [2018-12-03 17:37:28,797 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 17:37:28,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:37:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 17:37:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-03 17:37:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 17:37:28,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-12-03 17:37:28,802 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-12-03 17:37:28,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:28,802 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-12-03 17:37:28,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:37:28,803 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-12-03 17:37:28,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 17:37:28,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:28,804 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2018-12-03 17:37:28,804 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:28,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2018-12-03 17:37:28,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:28,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:28,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:28,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:28,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-03 17:37:32,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:32,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:32,102 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:32,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:32,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:32,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:37:32,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:37:32,113 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:37:32,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:37:32,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:32,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:32,281 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-03 17:37:32,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:41,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-03 17:37:41,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:41,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 17:37:41,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:41,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:37:41,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:37:41,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:37:41,821 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2018-12-03 17:37:42,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:42,745 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-12-03 17:37:42,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:37:42,746 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-12-03 17:37:42,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:42,746 INFO L225 Difference]: With dead ends: 280 [2018-12-03 17:37:42,747 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 17:37:42,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:37:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 17:37:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 17:37:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 17:37:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-03 17:37:42,752 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-12-03 17:37:42,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:42,753 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-03 17:37:42,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:37:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-03 17:37:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 17:37:42,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:42,754 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2018-12-03 17:37:42,754 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:42,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:42,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2018-12-03 17:37:42,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:42,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:42,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:42,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:42,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:46,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-03 17:37:46,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:46,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:46,193 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:46,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:46,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:46,193 INFO 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 17:37:46,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:46,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:46,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-03 17:37:46,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-03 17:37:55,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:55,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 17:37:55,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:55,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:37:55,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:37:55,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:37:55,831 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-12-03 17:37:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:57,078 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2018-12-03 17:37:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:37:57,078 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-12-03 17:37:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:57,079 INFO L225 Difference]: With dead ends: 283 [2018-12-03 17:37:57,079 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 17:37:57,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 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 17:37:57,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 17:37:57,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-03 17:37:57,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 17:37:57,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-03 17:37:57,084 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-03 17:37:57,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:57,084 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-03 17:37:57,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:37:57,084 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-03 17:37:57,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 17:37:57,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:57,085 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2018-12-03 17:37:57,086 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:57,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2018-12-03 17:37:57,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:57,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:57,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:57,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:57,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-03 17:38:00,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:00,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:00,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:00,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:00,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:00,337 INFO 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 17:38:00,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:38:00,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:38:05,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 17:38:05,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:06,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-03 17:38:06,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-03 17:38:15,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:15,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 17:38:15,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:15,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:38:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:38:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:38:15,812 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2018-12-03 17:38:16,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:16,828 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2018-12-03 17:38:16,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:38:16,828 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-12-03 17:38:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:16,829 INFO L225 Difference]: With dead ends: 286 [2018-12-03 17:38:16,829 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 17:38:16,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:38:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 17:38:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-03 17:38:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 17:38:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-12-03 17:38:16,834 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-12-03 17:38:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:16,835 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-12-03 17:38:16,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:38:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-12-03 17:38:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-03 17:38:16,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:16,836 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2018-12-03 17:38:16,836 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:16,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2018-12-03 17:38:16,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:16,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:16,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-03 17:38:20,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:20,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:20,147 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:20,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:20,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:20,148 INFO 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 17:38:20,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:38:20,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:38:20,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:38:20,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:20,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:20,352 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-03 17:38:20,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-03 17:38:30,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:30,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:38:30,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:30,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:38:30,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:38:30,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:38:30,322 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-12-03 17:38:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:31,608 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2018-12-03 17:38:31,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:38:31,608 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-12-03 17:38:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:31,609 INFO L225 Difference]: With dead ends: 289 [2018-12-03 17:38:31,609 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 17:38:31,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:38:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 17:38:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-03 17:38:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 17:38:31,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-03 17:38:31,613 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-12-03 17:38:31,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:31,614 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-03 17:38:31,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:38:31,614 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-03 17:38:31,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 17:38:31,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:31,615 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2018-12-03 17:38:31,615 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:31,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:31,615 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2018-12-03 17:38:31,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:31,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:31,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:31,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:31,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:35,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-03 17:38:35,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:35,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:35,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:35,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:35,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:35,116 INFO 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 17:38:35,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:35,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:38:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:35,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-03 17:38:35,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-03 17:38:45,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:45,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:38:45,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:45,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:38:45,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:38:45,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:38:45,610 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2018-12-03 17:38:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:46,952 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2018-12-03 17:38:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:38:46,953 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-12-03 17:38:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:46,954 INFO L225 Difference]: With dead ends: 292 [2018-12-03 17:38:46,954 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 17:38:46,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:38:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 17:38:46,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-03 17:38:46,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 17:38:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-03 17:38:46,959 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-03 17:38:46,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:46,960 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-03 17:38:46,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:38:46,960 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-03 17:38:46,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 17:38:46,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:46,961 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2018-12-03 17:38:46,961 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:46,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2018-12-03 17:38:46,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:46,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:46,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:46,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:46,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-03 17:38:50,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:50,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:50,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:50,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:50,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:50,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:38:50,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:38:50,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:38:57,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 17:38:57,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:57,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-03 17:38:57,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-03 17:39:08,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:08,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 17:39:08,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:08,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 17:39:08,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 17:39:08,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:39:08,034 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-12-03 17:39:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:09,516 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-12-03 17:39:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:39:09,516 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-12-03 17:39:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:09,517 INFO L225 Difference]: With dead ends: 295 [2018-12-03 17:39:09,517 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 17:39:09,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:39:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 17:39:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-03 17:39:09,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 17:39:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-12-03 17:39:09,522 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-12-03 17:39:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:09,523 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-12-03 17:39:09,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 17:39:09,523 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-12-03 17:39:09,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 17:39:09,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:09,524 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2018-12-03 17:39:09,524 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:09,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2018-12-03 17:39:09,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:09,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:09,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:09,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-03 17:39:13,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:13,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:13,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:13,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 17:39:13,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:13,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:39:13,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:39:13,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:39:13,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:39:13,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:13,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-03 17:39:13,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:24,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-03 17:39:24,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:24,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 17:39:24,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:24,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:39:24,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:39:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:39:24,105 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2018-12-03 17:39:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:25,627 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-12-03 17:39:25,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:39:25,628 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-12-03 17:39:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:25,629 INFO L225 Difference]: With dead ends: 298 [2018-12-03 17:39:25,629 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 17:39:25,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:39:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 17:39:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-03 17:39:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 17:39:25,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-12-03 17:39:25,633 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-12-03 17:39:25,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:25,634 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-12-03 17:39:25,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:39:25,634 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-12-03 17:39:25,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 17:39:25,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:25,634 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2018-12-03 17:39:25,635 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:25,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:25,635 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2018-12-03 17:39:25,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:25,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:25,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:25,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-03 17:39:29,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:29,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:29,693 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:29,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:29,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:29,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:39:29,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:29,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:39:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:29,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-03 17:39:29,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-03 17:39:40,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:40,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 17:39:40,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:40,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 17:39:40,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 17:39:40,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:39:40,769 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-12-03 17:39:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:41,953 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2018-12-03 17:39:41,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:39:41,954 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-12-03 17:39:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:41,955 INFO L225 Difference]: With dead ends: 301 [2018-12-03 17:39:41,955 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 17:39:41,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:39:41,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 17:39:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-03 17:39:41,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 17:39:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-03 17:39:41,960 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-12-03 17:39:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:41,960 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-03 17:39:41,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 17:39:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-03 17:39:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 17:39:41,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:41,961 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2018-12-03 17:39:41,961 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:41,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2018-12-03 17:39:41,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:41,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-03 17:39:45,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:45,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:45,847 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:45,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:45,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:45,848 INFO 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 17:39:45,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:39:45,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:03,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 17:40:03,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:03,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-03 17:40:03,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-03 17:40:14,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:14,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 17:40:14,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:14,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:40:14,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:40:14,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:40:14,998 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2018-12-03 17:40:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:16,567 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2018-12-03 17:40:16,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:40:16,567 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-12-03 17:40:16,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:16,568 INFO L225 Difference]: With dead ends: 304 [2018-12-03 17:40:16,568 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 17:40:16,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:40:16,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 17:40:16,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-03 17:40:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 17:40:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-12-03 17:40:16,573 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-12-03 17:40:16,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:16,573 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-12-03 17:40:16,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:40:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-12-03 17:40:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 17:40:16,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:16,574 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2018-12-03 17:40:16,574 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:16,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:16,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2018-12-03 17:40:16,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:16,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:16,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:16,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:16,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 17:40:20,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:20,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:20,480 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:20,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:20,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:20,481 INFO 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 17:40:20,489 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:20,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:20,658 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:20,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:20,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 17:40:20,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-03 17:40:31,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:31,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 17:40:31,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:31,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:40:31,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:40:31,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:40:31,712 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-12-03 17:40:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:33,315 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2018-12-03 17:40:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:40:33,315 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-12-03 17:40:33,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:33,316 INFO L225 Difference]: With dead ends: 307 [2018-12-03 17:40:33,316 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 17:40:33,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:40:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 17:40:33,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-03 17:40:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 17:40:33,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-03 17:40:33,321 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-12-03 17:40:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:33,321 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-03 17:40:33,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:40:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-03 17:40:33,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 17:40:33,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:33,322 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2018-12-03 17:40:33,322 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:33,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:33,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2018-12-03 17:40:33,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:33,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:33,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:33,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:33,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:37,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-03 17:40:37,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:37,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:37,388 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:37,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:37,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:37,388 INFO 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 17:40:37,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:37,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:37,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-03 17:40:37,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-03 17:40:49,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:49,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 17:40:49,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:49,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:40:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:40:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:40:49,083 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2018-12-03 17:40:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:50,571 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2018-12-03 17:40:50,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:40:50,572 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-12-03 17:40:50,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:50,573 INFO L225 Difference]: With dead ends: 310 [2018-12-03 17:40:50,573 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 17:40:50,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:40:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 17:40:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-03 17:40:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 17:40:50,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-12-03 17:40:50,579 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-12-03 17:40:50,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:50,579 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-12-03 17:40:50,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:40:50,579 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-12-03 17:40:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 17:40:50,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:50,580 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2018-12-03 17:40:50,580 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:50,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:50,581 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2018-12-03 17:40:50,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:50,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:50,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:50,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:50,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-03 17:40:54,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:54,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:54,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:54,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:54,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:54,405 INFO 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 17:40:54,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:54,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:15,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 17:41:15,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:15,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-03 17:41:15,905 INFO L316 TraceCheckSpWp]: Computing backward predicates...