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_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:44:26,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:44:26,526 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:44:26,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:44:26,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:44:26,547 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:44:26,548 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:44:26,551 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:44:26,553 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:44:26,557 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:44:26,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:44:26,558 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:44:26,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:44:26,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:44:26,562 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:44:26,562 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:44:26,563 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:44:26,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:44:26,567 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:44:26,569 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:44:26,570 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:44:26,571 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:44:26,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:44:26,574 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:44:26,574 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:44:26,575 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:44:26,576 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:44:26,577 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:44:26,577 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:44:26,578 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:44:26,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:44:26,579 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:44:26,579 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:44:26,580 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:44:26,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:44:26,581 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:44:26,581 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:44:26,596 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:44:26,596 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:44:26,598 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:44:26,598 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:44:26,599 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:44:26,599 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:44:26,599 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:44:26,599 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:44:26,599 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:44:26,600 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:44:26,600 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:44:26,601 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:44:26,601 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:44:26,601 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:44:26,601 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:44:26,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:44:26,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:44:26,602 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:44:26,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:44:26,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:44:26,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:44:26,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:44:26,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:44:26,604 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:44:26,604 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:44:26,604 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:44:26,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:44:26,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:44:26,605 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:44:26,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:44:26,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:44:26,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:44:26,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:44:26,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:44:26,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:44:26,606 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:44:26,606 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:44:26,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:44:26,607 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:44:26,607 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:44:26,607 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:44:26,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:44:26,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:44:26,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:44:26,672 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:44:26,673 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:44:26,673 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl [2018-12-03 16:44:26,674 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple1.i_3.bpl' [2018-12-03 16:44:26,733 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:44:26,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:44:26,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:44:26,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:44:26,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:44:26,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:44:26,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:44:26,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:44:26,779 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:44:26,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,803 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/1) ... [2018-12-03 16:44:26,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:44:26,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:44:26,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:44:26,806 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:44:26,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (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 16:44:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:44:26,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:44:27,076 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:44:27,077 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:44:27,077 INFO L202 PluginConnector]: Adding new model simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:44:27 BoogieIcfgContainer [2018-12-03 16:44:27,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:44:27,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:44:27,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:44:27,082 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:44:27,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:44:26" (1/2) ... [2018-12-03 16:44:27,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d244a75 and model type simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:44:27, skipping insertion in model container [2018-12-03 16:44:27,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:44:27" (2/2) ... [2018-12-03 16:44:27,086 INFO L112 eAbstractionObserver]: Analyzing ICFG simple1.i_3.bpl [2018-12-03 16:44:27,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:44:27,105 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:44:27,125 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:44:27,161 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:44:27,161 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:44:27,161 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:44:27,162 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:44:27,162 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:44:27,162 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:44:27,162 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:44:27,162 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:44:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:44:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:44:27,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:27,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:44:27,191 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:27,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:27,198 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 16:44:27,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:27,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:27,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:27,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:27,514 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 16:44:27,517 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 16:44:27,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:44:27,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:44:27,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:44:27,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:44:27,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:44:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:27,545 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:44:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:27,606 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 16:44:27,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:44:27,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:44:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:27,619 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:44:27,620 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:44:27,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:44:27,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:44:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:44:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:44:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:44:27,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:44:27,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:27,659 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:44:27,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:44:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:44:27,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:44:27,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:27,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:44:27,660 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:27,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:27,661 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 16:44:27,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:27,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:27,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:27,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:27,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:27,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:27,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:27,847 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:44:27,849 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 16:44:27,891 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:44:27,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:44:28,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:44:28,129 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:44:28,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:28,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:44:28,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:28,147 INFO 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 16:44:28,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:28,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:28,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:28,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:28,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:28,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 16:44:28,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:28,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:44:28,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:44:28,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:44:28,480 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 16:44:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:28,537 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:44:28,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:44:28,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 16:44:28,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:28,539 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:44:28,539 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:44:28,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:44:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:44:28,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:44:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:44:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:44:28,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:44:28,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:28,545 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:44:28,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:44:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:44:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:44:28,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:28,546 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:44:28,546 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:28,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 16:44:28,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:28,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:28,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:28,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:28,549 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:28,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:28,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:28,803 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:28,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:28,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:28,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 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 16:44:28,822 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:28,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:28,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:44:28,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:28,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:28,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:28,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:29,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:29,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:29,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 16:44:29,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:29,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:44:29,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:44:29,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:44:29,136 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 16:44:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:29,180 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:44:29,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:44:29,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 16:44:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:29,182 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:44:29,183 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:44:29,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:44:29,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:44:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:44:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:44:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:44:29,186 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:44:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:29,187 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:44:29,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:44:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:44:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:44:29,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:29,187 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:44:29,188 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:29,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 16:44:29,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:29,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:29,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:29,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:29,488 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:44:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:29,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:29,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:29,491 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:29,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 16:44:29,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:29,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 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 16:44:29,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:44:29,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:44:29,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:44:29,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:29,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:29,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:29,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:29,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 16:44:29,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:29,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:44:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:44:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:44:29,667 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 16:44:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:29,741 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:44:29,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:44:29,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 16:44:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:29,743 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:44:29,743 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:44:29,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:44:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:44:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:44:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:44:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:44:29,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:44:29,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:29,748 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:44:29,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:44:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:44:29,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:44:29,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:29,748 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:44:29,749 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:29,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 16:44:29,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:29,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:29,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:29,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:29,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:30,197 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:44:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:30,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:30,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:30,198 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:30,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 16:44:30,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:30,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 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 16:44:30,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:30,218 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:30,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:30,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:30,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:30,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 16:44:30,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:30,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:44:30,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:44:30,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:44:30,474 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 16:44:30,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:30,528 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:44:30,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:44:30,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 16:44:30,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:30,531 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:44:30,532 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:44:30,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:44:30,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:44:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:44:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:44:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:44:30,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:44:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:30,536 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:44:30,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:44:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:44:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:44:30,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:30,537 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:44:30,537 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:30,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:30,538 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 16:44:30,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:30,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:30,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:30,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:30,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:30,807 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:30,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:30,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:30,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:44:30,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:30,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:30,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:44:30,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:30,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:30,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:31,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:31,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 16:44:31,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:31,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:44:31,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:44:31,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:44:31,130 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 16:44:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:31,235 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:44:31,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:44:31,236 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 16:44:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:31,237 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:44:31,237 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:44:31,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:44:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:44:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:44:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:44:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:44:31,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:44:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:31,243 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:44:31,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:44:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:44:31,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:44:31,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:31,244 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:44:31,244 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:31,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 16:44:31,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:31,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:31,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:31,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:31,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:31,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:31,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:31,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:31,587 INFO 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 16:44:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:44:31,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:44:31,635 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:44:31,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:31,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:31,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:31,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:31,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 16:44:31,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:31,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:44:31,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:44:31,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:44:31,917 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 16:44:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:31,978 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:44:31,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:44:31,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 16:44:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:31,979 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:44:31,979 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:44:31,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:44:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:44:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:44:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:44:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 16:44:31,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 16:44:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:31,983 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 16:44:31,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:44:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 16:44:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:44:31,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:31,984 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:44:31,985 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:31,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:31,985 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 16:44:31,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:31,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:31,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:31,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:31,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:32,330 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 16:44:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:32,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:32,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:32,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:32,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 16:44:32,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:32,332 INFO 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 16:44:32,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:32,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:32,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:32,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:32,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:32,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:32,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 16:44:32,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:32,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:44:32,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:44:32,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:44:32,597 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 16:44:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:32,695 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 16:44:32,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:44:32,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 16:44:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:32,696 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:44:32,697 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:44:32,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:44:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:44:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:44:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:44:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:44:32,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 16:44:32,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:32,701 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:44:32,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:44:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:44:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:44:32,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:32,702 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:44:32,702 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:32,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 16:44:32,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:32,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:32,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:32,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:32,704 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:32,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:32,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:32,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:32,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:32,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:32,978 INFO 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 16:44:32,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:32,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:33,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:44:33,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:33,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:33,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:33,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:33,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 16:44:33,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:33,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:44:33,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:44:33,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:44:33,302 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 16:44:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:33,386 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:44:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:44:33,386 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 16:44:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:33,387 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:44:33,387 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:44:33,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:44:33,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:44:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:44:33,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:44:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 16:44:33,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 16:44:33,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:33,392 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 16:44:33,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:44:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 16:44:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:44:33,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:33,393 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 16:44:33,393 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:33,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:33,393 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 16:44:33,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:33,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:33,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:33,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:33,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:33,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:33,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:33,621 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:33,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:33,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:33,622 INFO 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 16:44:33,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:44:33,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:44:33,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:44:33,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:33,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:33,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:33,949 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:33,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:33,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 16:44:33,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:33,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:44:33,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:44:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:44:33,970 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 16:44:34,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:34,087 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 16:44:34,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:44:34,088 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 16:44:34,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:34,089 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:44:34,089 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:44:34,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:44:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:44:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:44:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:44:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:44:34,092 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 16:44:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:34,093 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:44:34,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:44:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:44:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:44:34,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:34,094 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 16:44:34,094 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:34,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 16:44:34,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:34,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:34,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:34,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:34,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:34,357 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:34,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:34,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:34,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:34,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:34,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:34,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:44:34,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:34,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:34,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:34,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:34,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:34,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 16:44:34,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:34,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:44:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:44:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:44:34,744 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 16:44:34,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:34,874 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:44:34,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:44:34,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 16:44:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:34,877 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:44:34,877 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:44:34,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:44:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:44:34,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:44:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:44:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 16:44:34,881 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 16:44:34,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:34,882 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 16:44:34,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:44:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 16:44:34,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:44:34,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:34,883 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 16:44:34,883 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:34,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:34,883 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 16:44:34,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:34,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:34,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:34,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:35,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:35,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:35,142 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:35,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:35,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:35,142 INFO 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 16:44:35,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:35,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:36,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:44:36,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:36,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:36,869 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:36,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:37,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:37,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 16:44:37,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:37,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:44:37,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:44:37,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:44:37,258 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 16:44:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:37,711 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 16:44:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:44:37,712 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 16:44:37,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:37,713 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:44:37,713 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:44:37,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:44:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:44:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:44:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:44:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:44:37,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 16:44:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:37,719 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:44:37,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:44:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:44:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:44:37,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:37,720 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 16:44:37,720 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:37,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 16:44:37,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:37,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:37,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:37,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:37,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:38,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:38,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:38,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:38,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 16:44:38,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:38,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 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 16:44:38,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:44:38,076 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:44:38,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:44:38,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:38,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:38,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:38,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:38,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 16:44:38,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:38,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:44:38,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:44:38,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:44:38,723 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 16:44:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:39,007 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:44:39,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:44:39,008 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 16:44:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:39,009 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:44:39,009 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:44:39,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:44:39,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:44:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:44:39,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:44:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 16:44:39,015 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 16:44:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:39,015 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 16:44:39,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:44:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 16:44:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:44:39,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:39,016 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 16:44:39,016 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:39,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:39,017 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 16:44:39,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:39,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:39,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:44:39,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:39,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:39,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:39,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:39,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:39,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:39,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:39,648 INFO 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 16:44:39,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:39,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:44:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:39,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:39,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:44:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:40,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:44:40,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 16:44:40,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:44:40,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:44:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:44:40,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:44:40,307 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 16:44:40,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:44:40,503 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 16:44:40,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:44:40,503 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 16:44:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:44:40,504 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:44:40,504 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:44:40,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:44:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:44:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:44:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:44:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:44:40,510 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 16:44:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:44:40,510 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:44:40,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:44:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:44:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:44:40,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:44:40,511 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 16:44:40,511 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:44:40,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:44:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 16:44:40,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:44:40,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:40,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:44:40,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:44:40,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:44:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:44:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:40,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:40,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:44:40,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:44:40,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:44:40,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:44:40,813 INFO 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 16:44:40,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:44:40,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:44:45,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:44:45,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:44:45,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:44:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:44:45,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 103 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:30,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:30,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 16:45:30,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:30,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:45:30,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:45:30,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=723, Unknown=15, NotChecked=0, Total=1056 [2018-12-03 16:45:30,430 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 16:45:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:30,622 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:45:30,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:45:30,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 16:45:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:30,624 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:45:30,624 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:45:30,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=318, Invalid=723, Unknown=15, NotChecked=0, Total=1056 [2018-12-03 16:45:30,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:45:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:45:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:45:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 16:45:30,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 16:45:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:30,629 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 16:45:30,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:45:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 16:45:30,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:45:30,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:30,630 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 16:45:30,630 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:30,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:30,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 16:45:30,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:30,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:30,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:30,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:30,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:30,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:30,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:30,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:30,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:30,919 INFO 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 16:45:30,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:45:30,929 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:45:30,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:45:30,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:30,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:31,181 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:31,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:31,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:31,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 16:45:31,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:31,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:45:31,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:45:31,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:45:31,770 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 16:45:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:31,986 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 16:45:31,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:45:31,987 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 16:45:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:31,988 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:45:31,988 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:45:31,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:45:31,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:45:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:45:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:45:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:45:31,993 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 16:45:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:31,993 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:45:31,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:45:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:45:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:45:31,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:31,994 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 16:45:31,994 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:31,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 16:45:31,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:31,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:31,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:32,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:32,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:32,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:32,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:32,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:32,485 INFO 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 16:45:32,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:32,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:45:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:32,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:32,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:33,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:33,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 16:45:33,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:33,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:45:33,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:45:33,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:45:33,274 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 16:45:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:33,518 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 16:45:33,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:45:33,519 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 16:45:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:33,520 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:45:33,520 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:45:33,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:45:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:45:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:45:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:45:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 16:45:33,524 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 16:45:33,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:33,525 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 16:45:33,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:45:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 16:45:33,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:45:33,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:33,525 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 16:45:33,526 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:33,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:33,526 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 16:45:33,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:33,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:33,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:33,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:33,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:33,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:33,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:33,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:33,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:33,878 INFO 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 16:45:33,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:45:33,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:45:34,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:45:34,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:34,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:34,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:35,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:35,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 16:45:35,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:35,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:45:35,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:45:35,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:45:35,267 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 16:45:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:35,574 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 16:45:35,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:45:35,576 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 16:45:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:35,577 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:45:35,577 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:45:35,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:45:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:45:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:45:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:45:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 16:45:35,583 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 16:45:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:35,583 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 16:45:35,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:45:35,583 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 16:45:35,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:45:35,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:35,584 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 16:45:35,584 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:35,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:35,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 16:45:35,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:35,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:35,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:35,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:35,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:35,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:35,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:35,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:35,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:35,910 INFO 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 16:45:35,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:45:35,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:45:35,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:45:35,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:35,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:36,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:37,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:37,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 16:45:37,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:37,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:45:37,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:45:37,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:45:37,280 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 16:45:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:37,668 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:45:37,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:45:37,669 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 16:45:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:37,670 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:45:37,670 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:45:37,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:45:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:45:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:45:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:45:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 16:45:37,675 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 16:45:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:37,676 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 16:45:37,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:45:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 16:45:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:45:37,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:37,677 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 16:45:37,677 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:37,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 16:45:37,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:37,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:45:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:37,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:38,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:38,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:38,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:38,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:38,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:38,107 INFO 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 16:45:38,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:38,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:45:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:38,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:38,218 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:38,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:45:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:39,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:45:39,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 16:45:39,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:45:39,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:45:39,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:45:39,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:45:39,052 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 16:45:39,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:45:39,328 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 16:45:39,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:45:39,329 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 16:45:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:45:39,330 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:45:39,330 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:45:39,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:45:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:45:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:45:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:45:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 16:45:39,335 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 16:45:39,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:45:39,336 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 16:45:39,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:45:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 16:45:39,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:45:39,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:45:39,336 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 16:45:39,337 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:45:39,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:45:39,337 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 16:45:39,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:45:39,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:39,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:45:39,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:45:39,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:45:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:45:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:40,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:40,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:45:40,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:45:40,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:45:40,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:45:40,424 INFO 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 16:45:40,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:45:40,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:45:40,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:45:40,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:45:40,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:45:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:45:40,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 200 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:51,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:51,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 16:47:51,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:51,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:47:51,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:47:51,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=570, Invalid=1358, Unknown=52, NotChecked=0, Total=1980 [2018-12-03 16:47:51,392 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 16:47:51,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:51,810 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 16:47:51,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:47:51,810 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 16:47:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:51,811 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:47:51,811 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:47:51,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 131.6s TimeCoverageRelationStatistics Valid=570, Invalid=1358, Unknown=52, NotChecked=0, Total=1980 [2018-12-03 16:47:51,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:47:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:47:51,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:47:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 16:47:51,817 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 16:47:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:51,817 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 16:47:51,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:47:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 16:47:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:47:51,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:51,819 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 16:47:51,819 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:51,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 16:47:51,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:51,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:51,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:47:51,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:51,820 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:52,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:52,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:52,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:52,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:47:52,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:52,385 INFO 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 16:47:52,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:47:52,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:47:52,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:47:52,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:47:52,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:52,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:53,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:53,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 16:47:53,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:53,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:47:53,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:47:53,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:47:53,581 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 16:47:53,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:53,930 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 16:47:53,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:47:53,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 16:47:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:53,933 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:47:53,933 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:47:53,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:47:53,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:47:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:47:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:47:53,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 16:47:53,937 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 16:47:53,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:53,938 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 16:47:53,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:47:53,938 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 16:47:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:47:53,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:53,939 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 16:47:53,939 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:53,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 16:47:53,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:53,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:53,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:47:53,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:53,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:54,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:54,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:54,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:54,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:47:54,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:54,574 INFO 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 16:47:54,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:47:54,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:47:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:54,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:47:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:54,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:47:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 252 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:58,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:47:58,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 16:47:58,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:47:58,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:47:58,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:47:58,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1681, Unknown=1, NotChecked=0, Total=2352 [2018-12-03 16:47:58,291 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 16:47:59,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:47:59,063 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:47:59,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:47:59,063 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 16:47:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:47:59,063 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:47:59,063 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:47:59,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=670, Invalid=1681, Unknown=1, NotChecked=0, Total=2352 [2018-12-03 16:47:59,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:47:59,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:47:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:47:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 16:47:59,068 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 16:47:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:47:59,069 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 16:47:59,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:47:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 16:47:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:47:59,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:47:59,070 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 16:47:59,070 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:47:59,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:47:59,070 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 16:47:59,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:47:59,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:59,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:47:59,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:47:59,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:47:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:47:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:47:59,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:59,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:47:59,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:47:59,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:47:59,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:47:59,480 INFO 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 16:47:59,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:47:59,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:48:08,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:48:08,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:48:08,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:08,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:10,616 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:10,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:10,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 16:48:10,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:10,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:48:10,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:48:10,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:48:10,638 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 16:48:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:11,328 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 16:48:11,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:48:11,328 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 16:48:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:11,329 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:48:11,329 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:48:11,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=723, Invalid=1827, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:48:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:48:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:48:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:48:11,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 16:48:11,335 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 16:48:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:11,336 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 16:48:11,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:48:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 16:48:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:48:11,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:11,337 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 16:48:11,337 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:11,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 16:48:11,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:11,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:48:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:11,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:11,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:11,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:11,848 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:11,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 16:48:11,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:11,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 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 16:48:11,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:48:11,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:48:11,873 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:48:11,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:48:11,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:11,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:13,297 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:13,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:13,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 16:48:13,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:13,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:48:13,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:48:13,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:48:13,319 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 16:48:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:13,813 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 16:48:13,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:48:13,813 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 16:48:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:13,814 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:48:13,814 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:48:13,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:48:13,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:48:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:48:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:48:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 16:48:13,820 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 16:48:13,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:13,821 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 16:48:13,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:48:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 16:48:13,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:48:13,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:13,822 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 16:48:13,822 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:13,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:13,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 16:48:13,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:13,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:48:13,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:13,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:15,050 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:15,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:15,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:15,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:15,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:48:15,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:15,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:48:15,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:15,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:48:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:15,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:48:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:15,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:48:16,904 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:16,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:48:16,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 16:48:16,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:48:16,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:48:16,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:48:16,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:48:16,931 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 16:48:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:48:17,468 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 16:48:17,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:48:17,469 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 16:48:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:48:17,470 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:48:17,470 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:48:17,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:48:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:48:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:48:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:48:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 16:48:17,474 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 16:48:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:48:17,474 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 16:48:17,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:48:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 16:48:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:48:17,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:48:17,475 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 16:48:17,475 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:48:17,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:48:17,476 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 16:48:17,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:48:17,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:17,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:48:17,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:48:17,477 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:48:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:48:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:48:18,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:18,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:48:18,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:48:18,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:48:18,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:48:18,063 INFO 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 16:48:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:48:18,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:02,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:49:02,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:02,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:02,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 335 refuted. 16 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:44,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:44,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 16:51:44,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:44,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:51:44,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:51:44,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2235, Unknown=63, NotChecked=0, Total=3192 [2018-12-03 16:51:44,015 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 16:51:44,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:44,614 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:51:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:51:44,615 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 16:51:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:44,616 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:51:44,616 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:51:44,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 162.3s TimeCoverageRelationStatistics Valid=894, Invalid=2235, Unknown=63, NotChecked=0, Total=3192 [2018-12-03 16:51:44,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:51:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:51:44,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:51:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 16:51:44,620 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 16:51:44,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:44,621 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 16:51:44,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:51:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 16:51:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:51:44,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:44,621 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 16:51:44,621 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:44,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 16:51:44,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:44,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:44,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:44,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:45,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:45,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:45,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:45,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:45,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:45,172 INFO 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 16:51:45,181 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:45,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:45,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:45,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:45,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:45,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:47,339 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:47,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:47,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 16:51:47,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:47,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:51:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:51:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:51:47,359 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 16:51:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:47,926 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 16:51:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:51:47,927 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 16:51:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:47,928 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:51:47,928 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:51:47,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:51:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:51:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:51:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:51:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 16:51:47,934 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 16:51:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:47,935 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 16:51:47,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:51:47,935 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 16:51:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:51:47,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:47,935 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 16:51:47,936 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:47,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:47,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 16:51:47,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:47,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:47,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:48,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:48,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:48,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:48,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:48,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:48,726 INFO 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 16:51:48,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:48,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:48,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:48,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:50,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:50,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 16:51:50,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:50,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:51:50,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:51:50,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:51:50,634 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 16:51:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:51,296 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 16:51:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:51:51,298 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 16:51:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:51,298 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:51:51,298 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:51:51,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:51:51,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:51:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:51:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:51:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 16:51:51,303 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 16:51:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:51,303 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 16:51:51,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:51:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 16:51:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:51:51,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:51,304 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 16:51:51,304 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:51,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 16:51:51,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:51,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:51,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:52,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:52,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:52,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:52,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:52,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:52,667 INFO 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 16:51:52,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:52,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:36,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:53:36,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:36,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:39,694 WARN L180 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-03 16:57:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 425 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:09,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:09,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 16:57:09,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:09,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:57:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:57:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=2747, Unknown=76, NotChecked=0, Total=3906 [2018-12-03 16:57:09,268 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 16:57:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:09,887 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 16:57:09,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:57:09,888 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 16:57:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:09,889 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:57:09,889 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:57:09,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 213.7s TimeCoverageRelationStatistics Valid=1083, Invalid=2747, Unknown=76, NotChecked=0, Total=3906 [2018-12-03 16:57:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:57:09,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:57:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:57:09,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 16:57:09,894 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 16:57:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:09,894 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 16:57:09,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:57:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 16:57:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:57:09,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:09,895 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 16:57:09,895 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:09,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:09,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 16:57:09,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:09,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:09,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:09,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:09,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:10,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:10,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:10,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:10,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 16:57:10,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:10,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 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 16:57:10,966 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:10,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:11,000 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:11,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:11,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:11,156 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:11,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:13,330 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:13,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:13,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2018-12-03 16:57:13,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:13,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:57:13,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:57:13,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:57:13,350 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 16:57:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:14,194 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:57:14,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:57:14,195 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 16:57:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:14,195 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:57:14,196 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:57:14,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1150, Invalid=3010, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:57:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:57:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:57:14,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:57:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 16:57:14,201 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 16:57:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:14,201 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 16:57:14,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:57:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 16:57:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:57:14,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:14,202 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 16:57:14,202 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:14,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:14,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 16:57:14,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:14,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:14,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:14,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:14,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:14,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:14,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:14,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:14,977 INFO 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 16:57:14,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:14,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:15,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:15,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:17,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:17,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 16:57:17,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:17,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:57:17,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:57:17,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:57:17,267 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 16:57:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:17,979 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 16:57:17,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:57:17,980 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 16:57:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:17,980 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:57:17,981 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:57:17,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1219, Invalid=3203, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:57:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:57:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:57:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:57:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 16:57:17,991 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 16:57:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:17,991 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 16:57:17,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:57:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 16:57:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:57:17,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:17,994 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 16:57:17,994 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:17,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:17,994 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 16:57:17,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:17,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:17,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:17,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:17,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:19,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:19,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:19,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:19,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:19,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:19,140 INFO 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 16:57:19,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:19,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)