java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 14:19:32,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 14:19:32,689 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 14:19:32,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 14:19:32,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 14:19:32,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 14:19:32,710 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 14:19:32,712 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 14:19:32,715 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 14:19:32,715 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 14:19:32,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 14:19:32,718 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 14:19:32,720 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 14:19:32,721 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 14:19:32,730 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 14:19:32,731 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 14:19:32,731 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 14:19:32,734 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 14:19:32,739 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 14:19:32,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 14:19:32,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 14:19:32,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 14:19:32,749 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 14:19:32,749 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 14:19:32,749 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 14:19:32,750 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 14:19:32,754 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 14:19:32,755 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 14:19:32,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 14:19:32,758 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 14:19:32,758 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 14:19:32,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 14:19:32,760 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 14:19:32,761 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 14:19:32,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 14:19:32,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 14:19:32,763 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-08 14:19:32,793 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 14:19:32,794 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 14:19:32,795 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 14:19:32,795 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 14:19:32,795 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 14:19:32,795 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 14:19:32,795 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 14:19:32,799 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 14:19:32,799 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 14:19:32,799 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-08 14:19:32,799 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-08 14:19:32,799 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 14:19:32,800 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 14:19:32,801 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 14:19:32,801 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 14:19:32,801 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 14:19:32,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 14:19:32,801 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 14:19:32,802 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 14:19:32,802 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 14:19:32,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 14:19:32,802 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 14:19:32,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 14:19:32,803 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 14:19:32,803 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 14:19:32,803 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 14:19:32,803 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 14:19:32,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 14:19:32,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 14:19:32,804 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 14:19:32,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 14:19:32,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 14:19:32,804 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 14:19:32,805 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 14:19:32,805 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 14:19:32,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 14:19:32,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 14:19:32,805 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 14:19:32,806 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 14:19:32,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 14:19:32,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 14:19:32,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 14:19:32,861 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 14:19:32,862 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 14:19:32,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-01-08 14:19:32,863 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-08 14:19:32,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 14:19:32,904 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 14:19:32,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 14:19:32,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 14:19:32,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 14:19:32,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 14:19:32,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 14:19:32,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 14:19:32,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 14:19:32,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/1) ... [2019-01-08 14:19:32,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 14:19:32,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 14:19:32,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 14:19:32,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 14:19:32,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 14:19:33,042 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-08 14:19:33,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 14:19:33,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 14:19:33,392 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 14:19:33,393 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-08 14:19:33,394 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:19:33 BoogieIcfgContainer [2019-01-08 14:19:33,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 14:19:33,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 14:19:33,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 14:19:33,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 14:19:33,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 02:19:32" (1/2) ... [2019-01-08 14:19:33,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac20f2d and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 02:19:33, skipping insertion in model container [2019-01-08 14:19:33,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 02:19:33" (2/2) ... [2019-01-08 14:19:33,403 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-08 14:19:33,414 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 14:19:33,423 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 14:19:33,441 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 14:19:33,475 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 14:19:33,475 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 14:19:33,476 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 14:19:33,476 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 14:19:33,476 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 14:19:33,476 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 14:19:33,476 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 14:19:33,477 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 14:19:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-08 14:19:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 14:19:33,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:33,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 14:19:33,505 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:33,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-08 14:19:33,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:33,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:33,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:33,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:33,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:33,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:33,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:33,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:19:33,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 14:19:33,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:19:33,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:19:33,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:19:33,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:19:33,809 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-08 14:19:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:33,995 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-08 14:19:33,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:19:33,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-08 14:19:33,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:34,009 INFO L225 Difference]: With dead ends: 26 [2019-01-08 14:19:34,010 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 14:19:34,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:19:34,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 14:19:34,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-08 14:19:34,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-08 14:19:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-08 14:19:34,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-08 14:19:34,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:34,055 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-08 14:19:34,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:19:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-08 14:19:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:19:34,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:34,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:19:34,056 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:34,057 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-08 14:19:34,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:34,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:34,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:34,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:34,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:34,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:19:34,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-08 14:19:34,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:19:34,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 14:19:34,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 14:19:34,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 14:19:34,172 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-08 14:19:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:34,275 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-08 14:19:34,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 14:19:34,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-08 14:19:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:34,277 INFO L225 Difference]: With dead ends: 25 [2019-01-08 14:19:34,277 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 14:19:34,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 14:19:34,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 14:19:34,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-08 14:19:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 14:19:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-08 14:19:34,284 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-08 14:19:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:34,285 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-08 14:19:34,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 14:19:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-08 14:19:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:19:34,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:34,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:19:34,287 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:34,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:34,287 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-08 14:19:34,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:34,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:34,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-08 14:19:34,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 14:19:34,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 14:19:34,340 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 14:19:34,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 14:19:34,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 14:19:34,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:19:34,342 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-08 14:19:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:34,392 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-08 14:19:34,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 14:19:34,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-08 14:19:34,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:34,393 INFO L225 Difference]: With dead ends: 24 [2019-01-08 14:19:34,393 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 14:19:34,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 14:19:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 14:19:34,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-08 14:19:34,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 14:19:34,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-08 14:19:34,397 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-08 14:19:34,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:34,398 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-08 14:19:34,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 14:19:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-08 14:19:34,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 14:19:34,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:34,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:19:34,400 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:34,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:34,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-08 14:19:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:34,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:34,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:34,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:34,722 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-08 14:19:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:34,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:34,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:34,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-08 14:19:34,783 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-08 14:19:34,849 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:19:34,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:19:35,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:19:35,104 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 14:19:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:35,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:19:35,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:35,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:35,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:35,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:35,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:35,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:35,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:35,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:35,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-08 14:19:35,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:35,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 14:19:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 14:19:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-08 14:19:35,514 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-08 14:19:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:35,739 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-08 14:19:35,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 14:19:35,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-08 14:19:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:35,742 INFO L225 Difference]: With dead ends: 26 [2019-01-08 14:19:35,742 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 14:19:35,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-08 14:19:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 14:19:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-08 14:19:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-08 14:19:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-08 14:19:35,748 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-08 14:19:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:35,749 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-08 14:19:35,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 14:19:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-08 14:19:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-08 14:19:35,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:35,750 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:19:35,750 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:35,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-08 14:19:35,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:35,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:35,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:35,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:35,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:35,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:35,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:35,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:35,849 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-08 14:19:35,849 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-08 14:19:35,852 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-08 14:19:35,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 14:19:36,073 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 14:19:36,073 INFO L272 AbstractInterpreter]: Visited 12 different actions 96 times. Merged at 11 different actions 70 times. Widened at 3 different actions 7 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2019-01-08 14:19:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:36,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 14:19:36,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:36,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:36,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:36,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:36,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:36,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:36,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:36,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-08 14:19:36,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:36,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 14:19:36,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 14:19:36,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-08 14:19:36,294 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-08 14:19:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:36,743 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-08 14:19:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 14:19:36,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-08 14:19:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:36,745 INFO L225 Difference]: With dead ends: 31 [2019-01-08 14:19:36,745 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 14:19:36,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-08 14:19:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 14:19:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-08 14:19:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 14:19:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-08 14:19:36,750 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-08 14:19:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:36,751 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-08 14:19:36,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 14:19:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-08 14:19:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-08 14:19:36,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:36,752 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 14:19:36,752 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:36,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:36,753 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-08 14:19:36,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:36,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:36,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:36,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:36,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:37,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:37,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:37,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:37,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:37,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:37,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:37,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:37,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:37,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 14:19:37,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:37,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:37,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:37,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:37,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:37,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-08 14:19:37,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:37,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:19:37,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:19:37,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:19:37,429 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-08 14:19:37,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:37,771 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-08 14:19:37,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 14:19:37,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-08 14:19:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:37,773 INFO L225 Difference]: With dead ends: 35 [2019-01-08 14:19:37,773 INFO L226 Difference]: Without dead ends: 28 [2019-01-08 14:19:37,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-08 14:19:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-08 14:19:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-08 14:19:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-08 14:19:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-08 14:19:37,779 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-08 14:19:37,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:37,780 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-08 14:19:37,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:19:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-08 14:19:37,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-08 14:19:37,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:37,781 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-08 14:19:37,781 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:37,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-08 14:19:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:37,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:37,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:37,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:37,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:37,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:37,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:37,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:37,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:37,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:37,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:37,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:37,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:37,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:37,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:37,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:38,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:38,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:38,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-08 14:19:38,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:38,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 14:19:38,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 14:19:38,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-08 14:19:38,101 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-08 14:19:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:38,225 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-08 14:19:38,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 14:19:38,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-08 14:19:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:38,227 INFO L225 Difference]: With dead ends: 45 [2019-01-08 14:19:38,227 INFO L226 Difference]: Without dead ends: 26 [2019-01-08 14:19:38,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:19:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-08 14:19:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-08 14:19:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-08 14:19:38,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-08 14:19:38,232 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-08 14:19:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:38,233 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-08 14:19:38,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 14:19:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-08 14:19:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-08 14:19:38,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:38,234 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-08 14:19:38,234 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:38,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:38,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-08 14:19:38,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:38,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:38,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:38,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:38,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:38,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:38,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:38,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:38,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:38,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:38,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:38,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:38,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:38,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:38,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:38,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-08 14:19:38,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:38,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:19:38,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:19:38,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:19:38,721 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-08 14:19:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:39,105 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-08 14:19:39,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 14:19:39,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-08 14:19:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:39,107 INFO L225 Difference]: With dead ends: 49 [2019-01-08 14:19:39,107 INFO L226 Difference]: Without dead ends: 39 [2019-01-08 14:19:39,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-01-08 14:19:39,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-08 14:19:39,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-08 14:19:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 14:19:39,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-08 14:19:39,114 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-08 14:19:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:39,114 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-08 14:19:39,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:19:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-08 14:19:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-08 14:19:39,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:39,115 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-08 14:19:39,116 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-08 14:19:39,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:39,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:39,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:39,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:39,233 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:39,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:39,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:39,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:39,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:39,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:39,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:39,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:39,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:39,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 14:19:39,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:39,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:39,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:39,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:39,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-08 14:19:39,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:39,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 14:19:39,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 14:19:39,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-08 14:19:39,417 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-08 14:19:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:39,781 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-08 14:19:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 14:19:39,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-08 14:19:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:39,783 INFO L225 Difference]: With dead ends: 60 [2019-01-08 14:19:39,783 INFO L226 Difference]: Without dead ends: 33 [2019-01-08 14:19:39,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-08 14:19:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-08 14:19:39,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-08 14:19:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 14:19:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-08 14:19:39,791 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-08 14:19:39,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:39,792 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-08 14:19:39,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 14:19:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-08 14:19:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-08 14:19:39,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:39,793 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-08 14:19:39,793 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:39,793 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-08 14:19:39,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:39,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:39,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:39,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:40,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:40,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:40,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:40,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:40,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:40,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:40,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:40,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:40,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:40,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:40,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:40,235 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:40,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:40,285 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:40,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:40,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-08 14:19:40,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:40,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 14:19:40,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 14:19:40,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:19:40,307 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-08 14:19:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:41,108 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-08 14:19:41,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 14:19:41,117 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-08 14:19:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:41,118 INFO L225 Difference]: With dead ends: 64 [2019-01-08 14:19:41,118 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 14:19:41,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-01-08 14:19:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 14:19:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-08 14:19:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 14:19:41,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-08 14:19:41,132 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-08 14:19:41,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:41,133 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-08 14:19:41,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 14:19:41,133 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-08 14:19:41,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-08 14:19:41,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:41,135 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-08 14:19:41,135 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:41,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-08 14:19:41,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:41,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:41,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:41,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:41,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:41,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:41,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:41,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:41,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:41,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:41,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:41,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:41,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:41,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:41,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-08 14:19:41,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:41,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 14:19:41,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 14:19:41,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-08 14:19:41,921 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-08 14:19:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:42,368 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-08 14:19:42,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 14:19:42,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-08 14:19:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:42,370 INFO L225 Difference]: With dead ends: 75 [2019-01-08 14:19:42,370 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 14:19:42,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-08 14:19:42,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 14:19:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-08 14:19:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 14:19:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-08 14:19:42,378 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-08 14:19:42,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:42,379 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-08 14:19:42,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 14:19:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-08 14:19:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-08 14:19:42,380 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:42,380 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-08 14:19:42,380 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-08 14:19:42,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:42,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:42,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:42,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:42,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:42,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:42,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:42,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:42,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:42,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:42,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:42,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-08 14:19:42,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:42,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:43,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:44,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:44,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-08 14:19:44,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:44,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-08 14:19:44,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-08 14:19:44,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 14:19:44,012 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-08 14:19:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:46,181 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-08 14:19:46,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 14:19:46,182 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-08 14:19:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:46,183 INFO L225 Difference]: With dead ends: 97 [2019-01-08 14:19:46,184 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 14:19:46,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 14:19:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 14:19:46,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-08 14:19:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 14:19:46,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-08 14:19:46,195 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-08 14:19:46,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:46,195 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-08 14:19:46,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-08 14:19:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-08 14:19:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-08 14:19:46,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:46,197 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-08 14:19:46,197 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:46,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:46,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-08 14:19:46,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:46,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:46,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:46,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:46,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:46,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:46,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:46,620 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:46,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:46,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:46,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:46,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:46,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:46,640 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:46,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:46,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:47,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:47,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:47,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-08 14:19:47,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:47,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 14:19:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 14:19:47,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:19:47,064 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-08 14:19:48,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:48,497 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-08 14:19:48,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 14:19:48,498 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-08 14:19:48,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:48,499 INFO L225 Difference]: With dead ends: 94 [2019-01-08 14:19:48,500 INFO L226 Difference]: Without dead ends: 72 [2019-01-08 14:19:48,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-08 14:19:48,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-08 14:19:48,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-08 14:19:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-08 14:19:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-08 14:19:48,510 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-08 14:19:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:48,510 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-08 14:19:48,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 14:19:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-08 14:19:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-08 14:19:48,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:48,511 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-08 14:19:48,512 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-08 14:19:48,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:48,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:48,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:48,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:48,671 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:48,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:48,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:48,672 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:48,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:48,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:48,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:48,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:48,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:48,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:48,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:49,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:49,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-08 14:19:49,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:49,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 14:19:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 14:19:49,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-08 14:19:49,027 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-08 14:19:49,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:49,270 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-08 14:19:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 14:19:49,271 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-08 14:19:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:49,272 INFO L225 Difference]: With dead ends: 105 [2019-01-08 14:19:49,273 INFO L226 Difference]: Without dead ends: 54 [2019-01-08 14:19:49,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-01-08 14:19:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-08 14:19:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-08 14:19:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 14:19:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-08 14:19:49,283 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-08 14:19:49,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:49,284 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-08 14:19:49,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 14:19:49,284 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-08 14:19:49,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-08 14:19:49,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:49,285 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-08 14:19:49,287 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:49,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:49,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-08 14:19:49,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:49,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:49,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:49,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:49,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:49,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:49,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:49,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:49,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:49,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:49,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:49,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:49,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-08 14:19:49,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:49,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:49,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:49,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:49,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-08 14:19:49,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:49,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 14:19:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 14:19:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-08 14:19:49,961 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-08 14:19:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:51,539 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-08 14:19:51,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 14:19:51,539 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-08 14:19:51,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:51,541 INFO L225 Difference]: With dead ends: 109 [2019-01-08 14:19:51,541 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 14:19:51,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 14:19:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 14:19:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-08 14:19:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-08 14:19:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-08 14:19:51,552 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-08 14:19:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:51,553 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-08 14:19:51,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 14:19:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-08 14:19:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-08 14:19:51,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:51,554 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-08 14:19:51,554 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-08 14:19:51,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:51,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:51,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:51,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:51,863 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:51,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:51,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:51,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:51,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:51,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:51,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:51,875 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:51,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:51,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:51,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:51,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:52,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:52,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:52,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-08 14:19:52,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:52,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 14:19:52,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 14:19:52,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-08 14:19:52,267 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-08 14:19:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:52,875 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-08 14:19:52,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 14:19:52,875 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-08 14:19:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:52,876 INFO L225 Difference]: With dead ends: 120 [2019-01-08 14:19:52,876 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 14:19:52,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 14:19:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 14:19:52,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-08 14:19:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 14:19:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-08 14:19:52,893 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-08 14:19:52,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:52,894 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-08 14:19:52,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 14:19:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-08 14:19:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-08 14:19:52,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:52,895 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-08 14:19:52,895 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:52,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:52,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-08 14:19:52,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:52,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:52,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:52,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:52,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:53,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:53,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:53,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:53,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:53,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:53,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:53,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:53,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:19:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:53,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:53,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:54,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:54,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-08 14:19:54,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:54,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 14:19:54,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 14:19:54,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-08 14:19:54,028 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-08 14:19:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:55,614 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-08 14:19:55,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 14:19:55,616 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-08 14:19:55,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:55,617 INFO L225 Difference]: With dead ends: 124 [2019-01-08 14:19:55,617 INFO L226 Difference]: Without dead ends: 94 [2019-01-08 14:19:55,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-08 14:19:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-08 14:19:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-08 14:19:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 14:19:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-08 14:19:55,629 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-08 14:19:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:55,630 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-08 14:19:55,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 14:19:55,630 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-08 14:19:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-08 14:19:55,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:55,631 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-08 14:19:55,631 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-08 14:19:55,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:55,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:19:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:55,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:55,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:55,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:55,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:55,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:55,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:55,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:55,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:19:55,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:19:55,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-08 14:19:55,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:55,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:56,149 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:56,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:56,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:56,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-08 14:19:56,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:56,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 14:19:56,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 14:19:56,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-08 14:19:56,288 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-08 14:19:56,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:19:56,824 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-08 14:19:56,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 14:19:56,825 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-08 14:19:56,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:19:56,825 INFO L225 Difference]: With dead ends: 135 [2019-01-08 14:19:56,825 INFO L226 Difference]: Without dead ends: 68 [2019-01-08 14:19:56,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 14:19:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-08 14:19:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-08 14:19:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-08 14:19:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-08 14:19:56,837 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-08 14:19:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:19:56,837 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-08 14:19:56,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 14:19:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-08 14:19:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-08 14:19:56,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:19:56,838 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-08 14:19:56,839 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:19:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:19:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-08 14:19:56,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:19:56,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:56,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:19:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:19:56,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:19:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:19:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:57,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:57,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:19:57,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:19:57,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:19:57,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:19:57,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:19:57,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:19:57,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:19:57,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:19:57,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:19:57,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:19:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:58,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:19:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:19:58,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:19:58,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-08 14:19:58,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:19:58,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 14:19:58,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 14:19:58,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-08 14:19:58,198 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-08 14:20:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:00,190 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-08 14:20:00,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 14:20:00,190 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-08 14:20:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:00,191 INFO L225 Difference]: With dead ends: 139 [2019-01-08 14:20:00,191 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 14:20:00,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 14:20:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 14:20:00,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-08 14:20:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-08 14:20:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-08 14:20:00,203 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-08 14:20:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:00,203 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-08 14:20:00,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 14:20:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-08 14:20:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-08 14:20:00,204 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:00,204 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-08 14:20:00,205 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:00,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:00,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-08 14:20:00,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:00,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:00,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:00,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:00,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:00,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:00,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:00,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:00,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:00,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:00,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:00,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:00,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:00,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:00,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-08 14:20:01,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:01,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 14:20:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 14:20:01,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-08 14:20:01,166 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-08 14:20:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:01,607 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-08 14:20:01,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 14:20:01,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-08 14:20:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:01,609 INFO L225 Difference]: With dead ends: 150 [2019-01-08 14:20:01,609 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 14:20:01,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 14:20:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 14:20:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-08 14:20:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 14:20:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-08 14:20:01,620 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-08 14:20:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:01,620 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-08 14:20:01,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 14:20:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-08 14:20:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-08 14:20:01,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:01,621 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-08 14:20:01,621 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:01,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:01,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-08 14:20:01,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:01,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:01,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:01,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:01,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:02,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:02,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:02,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:02,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:02,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:02,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:02,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:02,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:02,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-08 14:20:02,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:02,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:03,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:04,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:04,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-08 14:20:04,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:04,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 14:20:04,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 14:20:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 14:20:04,140 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-08 14:20:06,755 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-08 14:20:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:08,959 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-08 14:20:08,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 14:20:08,959 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-08 14:20:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:08,961 INFO L225 Difference]: With dead ends: 192 [2019-01-08 14:20:08,961 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 14:20:08,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-08 14:20:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 14:20:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-08 14:20:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-08 14:20:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-08 14:20:08,977 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-08 14:20:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:08,977 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-08 14:20:08,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 14:20:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-08 14:20:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-08 14:20:08,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:08,978 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-08 14:20:08,978 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-08 14:20:08,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:08,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:08,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:08,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:08,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:09,989 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:09,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:09,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:09,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:09,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:09,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:09,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:10,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:10,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:10,014 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:10,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:10,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:10,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:10,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:10,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-08 14:20:10,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:10,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 14:20:10,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 14:20:10,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 14:20:10,667 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-08 14:20:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:13,116 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-08 14:20:13,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 14:20:13,116 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-08 14:20:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:13,118 INFO L225 Difference]: With dead ends: 169 [2019-01-08 14:20:13,118 INFO L226 Difference]: Without dead ends: 127 [2019-01-08 14:20:13,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 14:20:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-08 14:20:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-08 14:20:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 14:20:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-08 14:20:13,133 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-08 14:20:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:13,133 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-08 14:20:13,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 14:20:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-08 14:20:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-08 14:20:13,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:13,135 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-08 14:20:13,135 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:13,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:13,136 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-08 14:20:13,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:13,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:13,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:13,138 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:13,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:13,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:13,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:13,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:13,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:13,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:13,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:13,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:13,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:13,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:14,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:14,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-08 14:20:14,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:14,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 14:20:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 14:20:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 14:20:14,119 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-08 14:20:14,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:14,646 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-08 14:20:14,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 14:20:14,646 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-08 14:20:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:14,647 INFO L225 Difference]: With dead ends: 180 [2019-01-08 14:20:14,648 INFO L226 Difference]: Without dead ends: 89 [2019-01-08 14:20:14,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 14:20:14,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-08 14:20:14,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-08 14:20:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-08 14:20:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-08 14:20:14,660 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-08 14:20:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:14,661 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-08 14:20:14,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 14:20:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-08 14:20:14,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-08 14:20:14,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:14,662 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-08 14:20:14,663 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-08 14:20:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:14,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:14,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:15,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:15,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:15,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:15,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:15,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:15,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:15,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:15,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:15,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-08 14:20:15,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:15,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:16,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:17,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:17,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-08 14:20:17,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:17,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-08 14:20:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-08 14:20:17,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-08 14:20:17,465 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-08 14:20:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:24,074 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-08 14:20:24,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-08 14:20:24,074 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-08 14:20:24,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:24,076 INFO L225 Difference]: With dead ends: 230 [2019-01-08 14:20:24,076 INFO L226 Difference]: Without dead ends: 135 [2019-01-08 14:20:24,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-08 14:20:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-08 14:20:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-08 14:20:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-08 14:20:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-08 14:20:24,097 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-08 14:20:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:24,097 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-08 14:20:24,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-08 14:20:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-08 14:20:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-08 14:20:24,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:24,098 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-08 14:20:24,099 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-08 14:20:24,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:24,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:24,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:24,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:24,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:24,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:24,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:24,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:24,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:24,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:24,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:24,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:24,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:24,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:25,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:25,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:25,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-08 14:20:25,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:25,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 14:20:25,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 14:20:25,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 14:20:25,408 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-08 14:20:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:28,945 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-08 14:20:28,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 14:20:28,945 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-08 14:20:28,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:28,947 INFO L225 Difference]: With dead ends: 199 [2019-01-08 14:20:28,947 INFO L226 Difference]: Without dead ends: 149 [2019-01-08 14:20:28,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 14:20:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-08 14:20:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-08 14:20:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-08 14:20:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-08 14:20:28,962 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-08 14:20:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:28,963 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-08 14:20:28,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 14:20:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-08 14:20:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-08 14:20:28,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:28,964 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-08 14:20:28,964 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-08 14:20:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:28,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:28,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:29,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:29,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:29,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:29,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:29,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:29,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:29,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:29,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:29,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:29,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:31,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:31,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-08 14:20:31,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:31,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 14:20:31,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 14:20:31,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 14:20:31,210 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-08 14:20:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:31,895 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-08 14:20:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 14:20:31,895 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-08 14:20:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:31,897 INFO L225 Difference]: With dead ends: 210 [2019-01-08 14:20:31,897 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 14:20:31,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 14:20:31,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 14:20:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-08 14:20:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-08 14:20:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-08 14:20:31,916 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-08 14:20:31,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:31,916 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-08 14:20:31,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 14:20:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-08 14:20:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-08 14:20:31,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:31,917 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-08 14:20:31,917 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:31,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-08 14:20:31,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:31,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:31,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:31,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:31,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:32,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:32,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:32,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:32,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:32,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:32,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:32,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:32,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:32,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-08 14:20:32,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:32,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:33,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:34,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:34,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-08 14:20:34,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:34,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 14:20:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 14:20:34,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-08 14:20:34,026 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-08 14:20:37,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:37,680 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-08 14:20:37,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-08 14:20:37,681 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-08 14:20:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:37,682 INFO L225 Difference]: With dead ends: 214 [2019-01-08 14:20:37,682 INFO L226 Difference]: Without dead ends: 160 [2019-01-08 14:20:37,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-08 14:20:37,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-08 14:20:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-08 14:20:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-08 14:20:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-08 14:20:37,704 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-08 14:20:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:37,704 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-08 14:20:37,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 14:20:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-08 14:20:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-08 14:20:37,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:37,705 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-08 14:20:37,705 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-08 14:20:37,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:37,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:37,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:37,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:37,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:38,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:38,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:38,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:38,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:38,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:38,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:38,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:38,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:38,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:38,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:38,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:38,843 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:39,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:39,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-08 14:20:39,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:39,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 14:20:39,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 14:20:39,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-08 14:20:39,187 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-08 14:20:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:39,835 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-08 14:20:39,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 14:20:39,835 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-08 14:20:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:39,836 INFO L225 Difference]: With dead ends: 225 [2019-01-08 14:20:39,836 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 14:20:39,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 14:20:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 14:20:39,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-08 14:20:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-08 14:20:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-08 14:20:39,858 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-08 14:20:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:39,858 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-08 14:20:39,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 14:20:39,859 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-08 14:20:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-08 14:20:39,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:39,859 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-08 14:20:39,860 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:39,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:39,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-08 14:20:39,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:39,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:39,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:39,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:39,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:40,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:40,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:40,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:40,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:40,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:40,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:40,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:40,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:40,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:41,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:41,387 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:41,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:41,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-08 14:20:41,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:41,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 14:20:41,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 14:20:41,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 14:20:41,409 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-08 14:20:46,659 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-08 14:20:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:46,980 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-08 14:20:46,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-08 14:20:46,981 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-08 14:20:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:46,982 INFO L225 Difference]: With dead ends: 229 [2019-01-08 14:20:46,982 INFO L226 Difference]: Without dead ends: 171 [2019-01-08 14:20:46,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 14:20:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-08 14:20:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-08 14:20:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-08 14:20:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-08 14:20:47,007 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-08 14:20:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:47,007 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-08 14:20:47,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 14:20:47,008 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-08 14:20:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-08 14:20:47,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:47,008 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-08 14:20:47,009 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-08 14:20:47,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:47,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:47,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:47,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:47,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:47,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:47,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:47,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:47,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:47,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:47,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:47,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:20:47,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:20:47,505 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-08 14:20:47,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:47,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:48,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:48,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:48,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-08 14:20:48,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:48,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 14:20:48,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 14:20:48,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 14:20:48,379 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-08 14:20:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:49,162 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-08 14:20:49,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 14:20:49,163 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-08 14:20:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:49,164 INFO L225 Difference]: With dead ends: 240 [2019-01-08 14:20:49,164 INFO L226 Difference]: Without dead ends: 117 [2019-01-08 14:20:49,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 14:20:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-08 14:20:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-08 14:20:49,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-08 14:20:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-08 14:20:49,186 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-08 14:20:49,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:49,187 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-08 14:20:49,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 14:20:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-08 14:20:49,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-08 14:20:49,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:49,188 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-08 14:20:49,188 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:49,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:49,188 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-08 14:20:49,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:49,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:49,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:49,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:49,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:50,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:50,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:50,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:50,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:50,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:50,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:50,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:20:50,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:20:50,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:20:50,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:20:50,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:51,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:51,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:51,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-08 14:20:51,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:51,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 14:20:51,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 14:20:51,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-08 14:20:51,215 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-08 14:20:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:20:56,605 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-08 14:20:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-08 14:20:56,610 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-08 14:20:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:20:56,611 INFO L225 Difference]: With dead ends: 244 [2019-01-08 14:20:56,611 INFO L226 Difference]: Without dead ends: 182 [2019-01-08 14:20:56,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-08 14:20:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-08 14:20:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-08 14:20:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-08 14:20:56,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-08 14:20:56,640 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-08 14:20:56,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:20:56,640 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-08 14:20:56,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 14:20:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-08 14:20:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-08 14:20:56,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:20:56,641 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-08 14:20:56,642 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:20:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:20:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-08 14:20:56,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:20:56,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:56,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:20:56,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:20:56,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:20:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:58,076 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:58,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:58,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:20:58,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:20:58,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:20:58,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:20:58,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:20:58,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:20:58,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:20:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:20:58,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:20:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:58,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:20:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:20:59,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:20:59,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-08 14:20:59,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:20:59,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 14:20:59,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 14:20:59,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-08 14:20:59,365 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-08 14:21:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:00,323 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-08 14:21:00,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 14:21:00,324 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-08 14:21:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:00,325 INFO L225 Difference]: With dead ends: 255 [2019-01-08 14:21:00,325 INFO L226 Difference]: Without dead ends: 124 [2019-01-08 14:21:00,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 14:21:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-08 14:21:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-08 14:21:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-08 14:21:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-08 14:21:00,347 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-08 14:21:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:00,347 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-08 14:21:00,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 14:21:00,347 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-08 14:21:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-08 14:21:00,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:00,348 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-08 14:21:00,348 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:00,349 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-08 14:21:00,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:00,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:00,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:00,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:00,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:01,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:01,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:01,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:01,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:01,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:01,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:01,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:21:01,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:21:01,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-08 14:21:01,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:01,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:03,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:05,631 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:05,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:05,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-08 14:21:05,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:05,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-08 14:21:05,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-08 14:21:05,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 14:21:05,655 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-08 14:21:14,362 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-01-08 14:21:16,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:16,358 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-08 14:21:16,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-08 14:21:16,358 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-08 14:21:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:16,360 INFO L225 Difference]: With dead ends: 325 [2019-01-08 14:21:16,360 INFO L226 Difference]: Without dead ends: 190 [2019-01-08 14:21:16,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-08 14:21:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-08 14:21:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-08 14:21:16,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-08 14:21:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-08 14:21:16,388 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-08 14:21:16,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:16,388 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-08 14:21:16,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-08 14:21:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-08 14:21:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-08 14:21:16,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:16,389 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-08 14:21:16,390 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:16,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-08 14:21:16,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:16,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:16,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:21:16,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:16,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:17,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:17,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:17,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:17,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:17,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:17,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:17,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:21:17,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:21:17,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:21:17,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:17,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:18,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:18,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:18,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-08 14:21:18,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:18,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-08 14:21:18,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-08 14:21:18,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 14:21:18,491 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-08 14:21:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:24,426 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-08 14:21:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-08 14:21:24,426 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-08 14:21:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:24,428 INFO L225 Difference]: With dead ends: 274 [2019-01-08 14:21:24,429 INFO L226 Difference]: Without dead ends: 204 [2019-01-08 14:21:24,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 14:21:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-08 14:21:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-08 14:21:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-08 14:21:24,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-08 14:21:24,457 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-08 14:21:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:24,457 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-08 14:21:24,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-08 14:21:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-08 14:21:24,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-08 14:21:24,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:24,458 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-08 14:21:24,458 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:24,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-08 14:21:24,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:24,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:24,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:21:24,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:24,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:25,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:25,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:25,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:25,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:25,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:25,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:25,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:25,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:21:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:25,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:25,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:25,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:26,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:26,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:26,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-08 14:21:26,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:26,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-08 14:21:26,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-08 14:21:26,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 14:21:26,451 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-08 14:21:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:27,377 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-08 14:21:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 14:21:27,378 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-08 14:21:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:27,379 INFO L225 Difference]: With dead ends: 285 [2019-01-08 14:21:27,379 INFO L226 Difference]: Without dead ends: 138 [2019-01-08 14:21:27,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 14:21:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-08 14:21:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-08 14:21:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-08 14:21:27,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-08 14:21:27,411 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-08 14:21:27,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:27,412 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-08 14:21:27,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-08 14:21:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-08 14:21:27,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-08 14:21:27,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:27,413 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-08 14:21:27,413 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-08 14:21:27,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:27,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:27,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:27,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:27,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:28,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:28,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:28,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:28,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:28,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:28,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:28,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:21:28,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:21:28,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-08 14:21:28,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:28,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:31,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:31,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:33,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:33,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-08 14:21:33,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:33,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-08 14:21:33,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-08 14:21:33,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 14:21:33,681 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-08 14:21:45,007 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-08 14:21:45,392 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-08 14:21:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:48,140 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-08 14:21:48,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-08 14:21:48,140 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-08 14:21:48,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:48,142 INFO L225 Difference]: With dead ends: 363 [2019-01-08 14:21:48,142 INFO L226 Difference]: Without dead ends: 212 [2019-01-08 14:21:48,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-08 14:21:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-08 14:21:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-08 14:21:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-08 14:21:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-08 14:21:48,174 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-08 14:21:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:48,174 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-08 14:21:48,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-08 14:21:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-08 14:21:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-08 14:21:48,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:48,175 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-08 14:21:48,175 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-08 14:21:48,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:48,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:48,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:21:48,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:48,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:49,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:49,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:49,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:49,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:49,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:49,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:49,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:21:49,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:21:49,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:21:49,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:21:49,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:50,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:21:51,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:51,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:21:51,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-08 14:21:51,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:21:51,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-08 14:21:51,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-08 14:21:51,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-08 14:21:51,047 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-08 14:21:55,497 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-08 14:21:55,825 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-08 14:21:56,096 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-08 14:21:56,277 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:21:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:21:58,067 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-08 14:21:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-08 14:21:58,068 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-08 14:21:58,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:21:58,069 INFO L225 Difference]: With dead ends: 304 [2019-01-08 14:21:58,070 INFO L226 Difference]: Without dead ends: 226 [2019-01-08 14:21:58,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-08 14:21:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-08 14:21:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-08 14:21:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-08 14:21:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-08 14:21:58,104 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-08 14:21:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:21:58,104 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-08 14:21:58,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-08 14:21:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-08 14:21:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-08 14:21:58,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:21:58,106 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-08 14:21:58,106 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:21:58,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:21:58,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-08 14:21:58,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:21:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:58,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:21:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:21:58,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:21:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:58,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:58,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:58,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:21:58,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:21:58,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:21:58,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:21:58,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:21:58,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:21:58,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:21:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:21:58,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:21:59,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:21:59,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:00,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:00,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-08 14:22:00,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:00,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-08 14:22:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-08 14:22:00,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-08 14:22:00,312 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-08 14:22:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:01,824 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-08 14:22:01,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 14:22:01,824 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-08 14:22:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:01,826 INFO L225 Difference]: With dead ends: 315 [2019-01-08 14:22:01,826 INFO L226 Difference]: Without dead ends: 152 [2019-01-08 14:22:01,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 14:22:01,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-08 14:22:01,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-08 14:22:01,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-08 14:22:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-08 14:22:01,862 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-08 14:22:01,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:01,863 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-08 14:22:01,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-08 14:22:01,863 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-08 14:22:01,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-08 14:22:01,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:01,864 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-08 14:22:01,864 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:01,865 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-08 14:22:01,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:01,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:01,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:22:01,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:01,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:03,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:03,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:03,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:03,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:03,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:03,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:03,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:22:03,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:22:03,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-08 14:22:03,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:22:03,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:06,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:09,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:09,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-08 14:22:09,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:09,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-08 14:22:09,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-08 14:22:09,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 14:22:09,372 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-08 14:22:21,929 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-08 14:22:22,247 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-08 14:22:22,569 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-08 14:22:22,856 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:22:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:25,609 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-08 14:22:25,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-08 14:22:25,610 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-08 14:22:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:25,611 INFO L225 Difference]: With dead ends: 401 [2019-01-08 14:22:25,612 INFO L226 Difference]: Without dead ends: 234 [2019-01-08 14:22:25,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-08 14:22:25,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-08 14:22:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-08 14:22:25,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-08 14:22:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-08 14:22:25,657 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-08 14:22:25,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:25,658 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-08 14:22:25,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-08 14:22:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-08 14:22:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-08 14:22:25,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:25,659 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-08 14:22:25,659 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:25,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:25,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-08 14:22:25,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:25,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:22:25,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:25,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:28,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:28,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:28,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:28,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:28,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:28,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:28,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:22:28,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:22:28,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:22:28,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:22:28,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:30,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:30,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:30,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-08 14:22:30,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:30,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-08 14:22:30,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-08 14:22:30,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-08 14:22:30,375 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-08 14:22:36,368 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-08 14:22:36,803 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-08 14:22:37,117 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-08 14:22:37,326 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:22:37,527 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:22:37,719 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:22:38,087 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-08 14:22:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:39,630 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-08 14:22:39,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-08 14:22:39,630 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-08 14:22:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:39,632 INFO L225 Difference]: With dead ends: 334 [2019-01-08 14:22:39,632 INFO L226 Difference]: Without dead ends: 248 [2019-01-08 14:22:39,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-08 14:22:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-08 14:22:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-08 14:22:39,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-08 14:22:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-08 14:22:39,666 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-08 14:22:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:39,666 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-08 14:22:39,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-08 14:22:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-08 14:22:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-08 14:22:39,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:39,668 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-08 14:22:39,668 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:39,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-08 14:22:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:39,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:22:39,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:39,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:40,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:40,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:40,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:40,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:40,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:40,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:40,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:22:40,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:22:40,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:40,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:42,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:42,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:43,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:43,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-08 14:22:43,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:43,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-08 14:22:43,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-08 14:22:43,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-08 14:22:43,156 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-08 14:22:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:44,860 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-08 14:22:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 14:22:44,862 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-08 14:22:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:44,863 INFO L225 Difference]: With dead ends: 345 [2019-01-08 14:22:44,863 INFO L226 Difference]: Without dead ends: 166 [2019-01-08 14:22:44,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 14:22:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-08 14:22:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-08 14:22:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-08 14:22:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-08 14:22:44,894 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-08 14:22:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:44,894 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-08 14:22:44,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-08 14:22:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-08 14:22:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-08 14:22:44,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:44,895 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-08 14:22:44,895 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:44,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-08 14:22:44,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:44,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:44,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:22:44,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:44,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:22:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:46,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:46,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:22:46,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:22:46,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:22:46,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:22:46,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:22:46,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:22:46,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:22:47,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-08 14:22:47,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:22:47,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:22:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:48,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:22:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:22:48,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:22:48,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-08 14:22:48,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:22:48,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 14:22:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 14:22:48,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 14:22:48,603 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-08 14:22:55,838 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-08 14:22:56,185 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-08 14:22:56,512 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-08 14:22:56,778 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:22:57,049 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:22:57,251 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:22:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:22:59,375 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-08 14:22:59,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-08 14:22:59,375 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-08 14:22:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:22:59,377 INFO L225 Difference]: With dead ends: 349 [2019-01-08 14:22:59,378 INFO L226 Difference]: Without dead ends: 259 [2019-01-08 14:22:59,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 14:22:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-08 14:22:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-08 14:22:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-08 14:22:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-08 14:22:59,415 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-08 14:22:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:22:59,415 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-08 14:22:59,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 14:22:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-08 14:22:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-08 14:22:59,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:22:59,416 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-08 14:22:59,416 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:22:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:22:59,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-08 14:22:59,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:22:59,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:59,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:22:59,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:22:59,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:22:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:00,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:00,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:00,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:00,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:00,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:00,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:00,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:23:00,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:23:00,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:23:00,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:23:00,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:01,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:01,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:02,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:02,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-08 14:23:02,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:02,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 14:23:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 14:23:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 14:23:02,577 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-08 14:23:04,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:04,431 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-08 14:23:04,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 14:23:04,431 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-08 14:23:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:04,432 INFO L225 Difference]: With dead ends: 360 [2019-01-08 14:23:04,433 INFO L226 Difference]: Without dead ends: 173 [2019-01-08 14:23:04,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 14:23:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-08 14:23:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-08 14:23:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-08 14:23:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-08 14:23:04,467 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-08 14:23:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:04,468 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-08 14:23:04,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 14:23:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-08 14:23:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-08 14:23:04,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:04,469 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-08 14:23:04,469 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-08 14:23:04,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:04,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:04,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:23:04,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:04,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:06,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:06,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:06,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:06,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:06,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:06,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:06,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:23:06,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:23:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:06,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:08,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:08,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:08,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:08,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-08 14:23:08,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:08,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-08 14:23:08,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-08 14:23:08,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-08 14:23:08,360 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-08 14:23:16,016 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-08 14:23:16,387 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-08 14:23:16,750 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-08 14:23:16,987 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:23:17,252 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:23:17,515 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:23:17,720 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:23:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:19,913 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-08 14:23:19,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-08 14:23:19,914 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-08 14:23:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:19,915 INFO L225 Difference]: With dead ends: 364 [2019-01-08 14:23:19,916 INFO L226 Difference]: Without dead ends: 270 [2019-01-08 14:23:19,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-08 14:23:19,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-08 14:23:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-08 14:23:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-08 14:23:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-08 14:23:19,952 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-08 14:23:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:19,952 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-08 14:23:19,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-08 14:23:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-08 14:23:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-08 14:23:19,953 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:19,953 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-08 14:23:19,954 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:19,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-08 14:23:19,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:19,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:23:19,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:19,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:20,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:20,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:20,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:20,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:20,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:20,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:20,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:20,988 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:23:20,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:23:21,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-08 14:23:21,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:23:21,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:22,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:23,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-08 14:23:23,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:23,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-08 14:23:23,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-08 14:23:23,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-08 14:23:23,560 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-08 14:23:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:25,467 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-08 14:23:25,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 14:23:25,468 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-08 14:23:25,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:25,469 INFO L225 Difference]: With dead ends: 375 [2019-01-08 14:23:25,469 INFO L226 Difference]: Without dead ends: 180 [2019-01-08 14:23:25,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 14:23:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-08 14:23:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-08 14:23:25,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-08 14:23:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-08 14:23:25,506 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-08 14:23:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:25,506 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-08 14:23:25,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-08 14:23:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-08 14:23:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-08 14:23:25,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:25,507 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-08 14:23:25,508 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-08 14:23:25,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:25,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:25,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:23:25,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:25,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:28,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:28,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:28,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:28,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:28,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:28,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:28,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:23:28,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:23:28,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:23:28,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:23:28,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:29,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:30,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:30,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:30,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-08 14:23:30,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:30,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 14:23:30,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 14:23:30,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 14:23:30,066 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-08 14:23:36,710 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-08 14:23:37,089 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-08 14:23:37,456 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-08 14:23:37,750 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:23:38,020 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:23:38,253 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:23:38,482 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:23:38,698 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:23:38,908 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:23:41,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:41,013 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-08 14:23:41,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-08 14:23:41,013 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-08 14:23:41,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:41,015 INFO L225 Difference]: With dead ends: 379 [2019-01-08 14:23:41,015 INFO L226 Difference]: Without dead ends: 281 [2019-01-08 14:23:41,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 14:23:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-08 14:23:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-08 14:23:41,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-08 14:23:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-08 14:23:41,061 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-08 14:23:41,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:41,061 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-08 14:23:41,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 14:23:41,061 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-08 14:23:41,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-08 14:23:41,062 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:41,062 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-08 14:23:41,063 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:41,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:41,063 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-08 14:23:41,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:41,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:41,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:23:41,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:41,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:42,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:42,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:42,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:42,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:42,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:42,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:42,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:42,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:23:42,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:23:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:42,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:43,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:44,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:44,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-08 14:23:44,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:44,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 14:23:44,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 14:23:44,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 14:23:44,484 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-08 14:23:46,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:23:46,522 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-08 14:23:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 14:23:46,523 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-08 14:23:46,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:23:46,524 INFO L225 Difference]: With dead ends: 390 [2019-01-08 14:23:46,524 INFO L226 Difference]: Without dead ends: 187 [2019-01-08 14:23:46,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 14:23:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-08 14:23:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-08 14:23:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-08 14:23:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-08 14:23:46,569 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-08 14:23:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:23:46,570 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-08 14:23:46,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 14:23:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-08 14:23:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-08 14:23:46,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:23:46,571 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-08 14:23:46,571 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:23:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:23:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-08 14:23:46,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:23:46,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:46,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:23:46,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:23:46,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:23:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:23:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:49,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:49,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:23:49,259 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:23:49,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:23:49,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:23:49,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:23:49,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:23:49,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:23:49,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-08 14:23:49,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:23:49,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:23:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:53,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:23:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:23:57,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:23:57,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-08 14:23:57,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:23:57,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-08 14:23:57,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-08 14:23:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-08 14:23:57,921 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-08 14:24:16,540 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-08 14:24:17,011 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-08 14:24:17,498 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-08 14:24:17,889 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:24:18,285 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:24:18,697 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:24:19,091 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:24:19,431 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:24:19,768 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:24:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:24:23,095 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-08 14:24:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-08 14:24:23,095 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-08 14:24:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:24:23,096 INFO L225 Difference]: With dead ends: 496 [2019-01-08 14:24:23,096 INFO L226 Difference]: Without dead ends: 289 [2019-01-08 14:24:23,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-08 14:24:23,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-08 14:24:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-08 14:24:23,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-08 14:24:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-08 14:24:23,144 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-08 14:24:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:24:23,144 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-08 14:24:23,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-08 14:24:23,144 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-08 14:24:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-08 14:24:23,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:24:23,145 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-08 14:24:23,145 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:24:23,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:24:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-08 14:24:23,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:24:23,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:23,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:24:23,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:23,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:24:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:25,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:25,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:24:25,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:24:25,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:24:25,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:25,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:24:25,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:24:25,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:24:25,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:24:25,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:24:25,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:24:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:27,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:24:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:27,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:24:27,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-08 14:24:27,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:24:27,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 14:24:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 14:24:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 14:24:27,550 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-08 14:24:36,403 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-08 14:24:36,826 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-08 14:24:37,229 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-08 14:24:37,507 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:24:37,796 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:24:38,051 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:24:38,308 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:24:38,537 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:24:38,772 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:24:39,002 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:24:39,274 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:24:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:24:41,507 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-08 14:24:41,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-08 14:24:41,507 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-08 14:24:41,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:24:41,509 INFO L225 Difference]: With dead ends: 409 [2019-01-08 14:24:41,509 INFO L226 Difference]: Without dead ends: 303 [2019-01-08 14:24:41,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 14:24:41,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-08 14:24:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-08 14:24:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-08 14:24:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-08 14:24:41,553 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-08 14:24:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:24:41,553 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-08 14:24:41,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 14:24:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-08 14:24:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-08 14:24:41,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:24:41,554 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-08 14:24:41,555 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:24:41,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:24:41,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-08 14:24:41,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:24:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:41,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:24:41,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:41,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:24:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:42,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:42,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:24:42,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:24:42,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:24:42,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:42,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:24:42,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:24:42,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:24:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:42,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:24:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:46,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:24:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:47,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:24:47,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-08 14:24:47,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:24:47,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 14:24:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 14:24:47,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 14:24:47,492 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-08 14:24:50,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:24:50,107 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-08 14:24:50,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-08 14:24:50,108 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-08 14:24:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:24:50,109 INFO L225 Difference]: With dead ends: 420 [2019-01-08 14:24:50,109 INFO L226 Difference]: Without dead ends: 201 [2019-01-08 14:24:50,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 14:24:50,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-08 14:24:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-08 14:24:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-08 14:24:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-08 14:24:50,153 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-08 14:24:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:24:50,153 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-08 14:24:50,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 14:24:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-08 14:24:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-08 14:24:50,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:24:50,154 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-08 14:24:50,154 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:24:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:24:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-08 14:24:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:24:50,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:24:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:24:50,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:24:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:24:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:52,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:52,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:24:52,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:24:52,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:24:52,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:24:52,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:24:52,099 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:24:52,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:24:52,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-08 14:24:52,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:24:52,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:24:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:54,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:24:54,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:24:54,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:24:54,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-08 14:24:54,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:24:54,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-08 14:24:54,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-08 14:24:54,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-08 14:24:54,473 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-08 14:25:03,478 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-08 14:25:03,905 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-08 14:25:04,329 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-08 14:25:04,641 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:25:04,997 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:25:05,291 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:25:05,561 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:25:05,825 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:25:06,079 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:25:06,322 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:25:06,550 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:25:06,768 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:25:09,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:25:09,031 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-08 14:25:09,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-08 14:25:09,032 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-08 14:25:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:25:09,034 INFO L225 Difference]: With dead ends: 424 [2019-01-08 14:25:09,034 INFO L226 Difference]: Without dead ends: 314 [2019-01-08 14:25:09,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-08 14:25:09,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-08 14:25:09,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-08 14:25:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-08 14:25:09,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-08 14:25:09,087 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-08 14:25:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:25:09,087 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-08 14:25:09,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-08 14:25:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-08 14:25:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-08 14:25:09,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:25:09,089 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-08 14:25:09,089 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:25:09,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:25:09,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-08 14:25:09,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:25:09,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:09,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:25:09,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:09,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:25:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:10,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:10,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:25:10,619 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:25:10,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:25:10,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:10,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:25:10,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:25:10,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:25:10,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:25:10,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:25:10,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:25:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:12,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:25:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:13,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:25:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-08 14:25:13,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:25:13,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-08 14:25:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-08 14:25:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-08 14:25:13,195 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-08 14:25:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:25:15,908 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-08 14:25:15,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-08 14:25:15,909 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-08 14:25:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:25:15,910 INFO L225 Difference]: With dead ends: 435 [2019-01-08 14:25:15,910 INFO L226 Difference]: Without dead ends: 208 [2019-01-08 14:25:15,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 14:25:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-08 14:25:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-08 14:25:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-08 14:25:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-08 14:25:15,970 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-08 14:25:15,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:25:15,970 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-08 14:25:15,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-08 14:25:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-08 14:25:15,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-08 14:25:15,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:25:15,972 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-08 14:25:15,972 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:25:15,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:25:15,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-08 14:25:15,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:25:15,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:15,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:25:15,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:15,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:25:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:18,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:18,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:25:18,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:25:18,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:25:18,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:18,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:25:18,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:25:18,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:25:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:18,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:25:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:20,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:25:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:20,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:25:20,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-08 14:25:20,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:25:20,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 14:25:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 14:25:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 14:25:20,765 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-08 14:25:30,083 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-08 14:25:30,586 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-08 14:25:31,027 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-08 14:25:31,341 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:25:31,655 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:25:31,942 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:25:32,235 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:25:32,530 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:25:32,798 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:25:33,049 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:25:33,298 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:25:33,539 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:25:36,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:25:36,204 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-08 14:25:36,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-08 14:25:36,204 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-08 14:25:36,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:25:36,206 INFO L225 Difference]: With dead ends: 439 [2019-01-08 14:25:36,206 INFO L226 Difference]: Without dead ends: 325 [2019-01-08 14:25:36,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 14:25:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-08 14:25:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-08 14:25:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-08 14:25:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-08 14:25:36,262 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-08 14:25:36,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:25:36,262 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-08 14:25:36,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 14:25:36,262 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-08 14:25:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-08 14:25:36,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:25:36,264 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-08 14:25:36,264 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:25:36,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:25:36,264 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-08 14:25:36,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:25:36,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:36,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:25:36,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:36,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:25:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:37,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:37,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:25:37,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:25:37,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:25:37,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:37,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:25:37,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:25:37,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:25:37,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-08 14:25:37,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:25:37,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:25:39,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:39,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:25:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:40,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:25:40,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-08 14:25:40,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:25:40,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 14:25:40,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 14:25:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 14:25:40,465 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-08 14:25:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:25:43,354 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-08 14:25:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-08 14:25:43,354 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-08 14:25:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:25:43,356 INFO L225 Difference]: With dead ends: 450 [2019-01-08 14:25:43,356 INFO L226 Difference]: Without dead ends: 215 [2019-01-08 14:25:43,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 14:25:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-08 14:25:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-08 14:25:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-08 14:25:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-08 14:25:43,430 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-08 14:25:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:25:43,430 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-08 14:25:43,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 14:25:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-08 14:25:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-08 14:25:43,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:25:43,432 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-08 14:25:43,432 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:25:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:25:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-08 14:25:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:25:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:43,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:25:43,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:25:43,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:25:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:25:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:45,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:45,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:25:45,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:25:45,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:25:45,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:25:45,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:25:45,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:25:45,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:25:45,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:25:45,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:25:45,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:25:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:48,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:25:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:25:48,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:25:48,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-08 14:25:48,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:25:48,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-08 14:25:48,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-08 14:25:48,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 14:25:48,475 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-08 14:25:59,087 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-08 14:25:59,562 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-08 14:26:00,021 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-08 14:26:00,357 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:26:00,668 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:26:00,992 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:26:01,342 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:26:01,631 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:26:01,912 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:26:02,182 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:26:02,451 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:26:02,696 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:26:02,941 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:26:03,629 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-08 14:26:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:26:05,587 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-08 14:26:05,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-08 14:26:05,587 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-08 14:26:05,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:26:05,589 INFO L225 Difference]: With dead ends: 454 [2019-01-08 14:26:05,589 INFO L226 Difference]: Without dead ends: 336 [2019-01-08 14:26:05,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-08 14:26:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-08 14:26:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-08 14:26:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-08 14:26:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-08 14:26:05,648 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-08 14:26:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:26:05,648 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-08 14:26:05,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-08 14:26:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-08 14:26:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-08 14:26:05,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:26:05,649 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-08 14:26:05,649 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:26:05,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:26:05,650 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-08 14:26:05,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:26:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:05,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:26:05,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:05,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:26:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:26:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:26:07,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:07,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:26:07,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:26:07,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:26:07,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:07,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:26:07,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:26:07,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:26:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:26:07,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:26:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:26:08,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:26:10,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:26:10,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:26:10,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-08 14:26:10,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:26:10,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-08 14:26:10,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-08 14:26:10,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 14:26:10,115 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-08 14:26:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:26:13,226 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-08 14:26:13,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-08 14:26:13,226 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-08 14:26:13,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:26:13,227 INFO L225 Difference]: With dead ends: 465 [2019-01-08 14:26:13,228 INFO L226 Difference]: Without dead ends: 222 [2019-01-08 14:26:13,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 14:26:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-08 14:26:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-08 14:26:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-08 14:26:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-08 14:26:13,303 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-08 14:26:13,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:26:13,304 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-08 14:26:13,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-08 14:26:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-08 14:26:13,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-08 14:26:13,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:26:13,305 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-08 14:26:13,305 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:26:13,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:26:13,305 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-08 14:26:13,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:26:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:13,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:26:13,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:26:13,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:26:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:26:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:26:15,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:15,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:26:15,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:26:15,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:26:15,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:26:15,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:26:15,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:26:15,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:26:15,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-08 14:26:15,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:26:15,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:26:22,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:26:22,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:26:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:26:28,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:26:28,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-08 14:26:28,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:26:28,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-08 14:26:28,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-08 14:26:28,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 14:26:28,255 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-08 14:26:53,568 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-08 14:26:54,198 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-08 14:26:54,824 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-08 14:26:55,345 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:26:55,872 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:26:56,371 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:26:56,882 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:26:57,385 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:26:57,864 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:26:58,299 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:26:58,722 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:26:59,130 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:26:59,544 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:26:59,916 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:27:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:27:03,823 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-08 14:27:03,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-08 14:27:03,823 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-08 14:27:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:27:03,825 INFO L225 Difference]: With dead ends: 591 [2019-01-08 14:27:03,826 INFO L226 Difference]: Without dead ends: 344 [2019-01-08 14:27:03,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-08 14:27:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-08 14:27:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-08 14:27:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-08 14:27:03,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-08 14:27:03,891 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-08 14:27:03,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:27:03,891 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-08 14:27:03,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-08 14:27:03,891 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-08 14:27:03,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-08 14:27:03,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:27:03,892 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-08 14:27:03,893 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:27:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:27:03,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-08 14:27:03,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:27:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:03,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:27:03,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:03,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:27:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:27:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:06,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:06,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:27:06,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:27:06,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:27:06,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:06,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:27:06,406 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:27:06,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:27:06,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:27:06,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:27:06,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:27:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:09,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:27:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:09,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:27:09,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-08 14:27:09,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:27:09,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-08 14:27:09,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-08 14:27:09,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-08 14:27:09,570 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-08 14:27:22,865 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-08 14:27:23,574 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-08 14:27:24,106 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-08 14:27:24,475 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:27:24,825 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:27:25,162 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:27:25,494 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:27:25,817 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:27:26,132 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:27:26,439 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:27:26,737 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:27:27,054 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:27:27,336 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:27:27,603 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:27:27,878 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:27:28,183 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:27:28,459 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-08 14:27:30,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:27:30,823 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-08 14:27:30,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-08 14:27:30,823 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-08 14:27:30,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:27:30,825 INFO L225 Difference]: With dead ends: 484 [2019-01-08 14:27:30,825 INFO L226 Difference]: Without dead ends: 358 [2019-01-08 14:27:30,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-08 14:27:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-08 14:27:30,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-08 14:27:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-08 14:27:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-08 14:27:30,889 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-08 14:27:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:27:30,889 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-08 14:27:30,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-08 14:27:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-08 14:27:30,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-08 14:27:30,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:27:30,891 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-08 14:27:30,891 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:27:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:27:30,892 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-08 14:27:30,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:27:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:30,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:27:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:30,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:27:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:27:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:32,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:32,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:27:32,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:27:32,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:27:32,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:32,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:27:32,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:27:32,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:27:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:27:32,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:27:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:34,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:27:36,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:36,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:27:36,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-08 14:27:36,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:27:36,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-08 14:27:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-08 14:27:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-08 14:27:36,426 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-08 14:27:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:27:39,128 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-08 14:27:39,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-08 14:27:39,129 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-08 14:27:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:27:39,130 INFO L225 Difference]: With dead ends: 495 [2019-01-08 14:27:39,130 INFO L226 Difference]: Without dead ends: 236 [2019-01-08 14:27:39,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 14:27:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-08 14:27:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-08 14:27:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-08 14:27:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-08 14:27:39,195 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-08 14:27:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:27:39,196 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-08 14:27:39,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-08 14:27:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-08 14:27:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-08 14:27:39,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:27:39,197 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-08 14:27:39,197 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:27:39,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:27:39,198 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-08 14:27:39,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:27:39,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:39,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:27:39,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:27:39,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:27:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:27:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:41,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:41,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:27:41,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:27:41,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:27:41,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:27:41,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:27:41,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:27:41,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:27:42,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-08 14:27:42,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:27:42,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:27:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:49,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:27:56,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:27:56,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:27:56,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-08 14:27:56,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:27:56,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-08 14:27:56,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-08 14:27:56,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 14:27:56,114 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-08 14:28:23,057 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-08 14:28:23,682 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-08 14:28:24,377 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-08 14:28:24,989 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:28:25,553 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:28:26,118 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:28:26,643 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:28:27,166 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:28:27,668 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:28:28,152 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:28:28,620 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:28:29,084 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:28:29,577 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:28:30,062 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:28:30,478 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:28:30,881 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:28:31,259 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:28:35,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:28:35,065 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-08 14:28:35,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-08 14:28:35,066 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-08 14:28:35,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:28:35,067 INFO L225 Difference]: With dead ends: 629 [2019-01-08 14:28:35,067 INFO L226 Difference]: Without dead ends: 366 [2019-01-08 14:28:35,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-08 14:28:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-08 14:28:35,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-08 14:28:35,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-08 14:28:35,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-08 14:28:35,136 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-08 14:28:35,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:28:35,136 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-08 14:28:35,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-08 14:28:35,136 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-08 14:28:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-08 14:28:35,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:28:35,137 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-08 14:28:35,138 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:28:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:28:35,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-08 14:28:35,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:28:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:28:35,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:28:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:28:35,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:28:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:28:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:28:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:28:37,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:28:37,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:28:37,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:28:37,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:28:37,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:28:37,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:28:37,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:28:37,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:28:37,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:28:37,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:28:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:28:41,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:28:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:28:41,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:28:41,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-08 14:28:41,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:28:41,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-08 14:28:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-08 14:28:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-08 14:28:41,441 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-08 14:28:54,013 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-08 14:28:54,587 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-08 14:28:55,193 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-08 14:28:55,614 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:28:56,027 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:28:56,405 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:28:56,767 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:28:57,131 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:28:57,471 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:28:57,808 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:28:58,138 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:28:58,460 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:28:58,771 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:28:59,091 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:28:59,378 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:28:59,655 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:28:59,931 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:29:00,218 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:29:00,525 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-08 14:29:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:29:03,011 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-08 14:29:03,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-08 14:29:03,012 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-08 14:29:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:29:03,013 INFO L225 Difference]: With dead ends: 514 [2019-01-08 14:29:03,014 INFO L226 Difference]: Without dead ends: 380 [2019-01-08 14:29:03,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-08 14:29:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-08 14:29:03,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-08 14:29:03,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-08 14:29:03,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-08 14:29:03,082 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-08 14:29:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:29:03,082 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-08 14:29:03,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-08 14:29:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-08 14:29:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-08 14:29:03,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:29:03,083 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-08 14:29:03,083 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:29:03,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:29:03,083 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-08 14:29:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:29:03,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:03,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:29:03,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:03,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:29:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:29:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:29:04,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:04,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:29:04,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:29:04,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:29:04,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:04,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:29:04,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:29:04,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:29:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:29:04,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:29:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:29:06,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:29:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:29:08,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:29:08,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-08 14:29:08,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:29:08,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-08 14:29:08,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-08 14:29:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-08 14:29:08,591 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-08 14:29:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:29:11,618 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-08 14:29:11,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 14:29:11,619 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-08 14:29:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:29:11,620 INFO L225 Difference]: With dead ends: 525 [2019-01-08 14:29:11,620 INFO L226 Difference]: Without dead ends: 250 [2019-01-08 14:29:11,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 14:29:11,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-08 14:29:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-08 14:29:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-08 14:29:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-08 14:29:11,689 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-08 14:29:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:29:11,690 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-08 14:29:11,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-08 14:29:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-08 14:29:11,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-08 14:29:11,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:29:11,691 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-08 14:29:11,692 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:29:11,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:29:11,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-08 14:29:11,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:29:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:11,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:29:11,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:29:11,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:29:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:29:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:29:14,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:14,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:29:14,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:29:14,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:29:14,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:29:14,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:29:14,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:29:14,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:29:14,671 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-08 14:29:14,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:29:14,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:29:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:29:22,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:29:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:29:30,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:29:30,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-08 14:29:30,203 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:29:30,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-08 14:29:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-08 14:29:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:29:30,205 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-08 14:29:59,508 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-08 14:30:00,216 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-08 14:30:00,906 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-08 14:30:01,563 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-08 14:30:02,237 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:30:02,860 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:30:03,472 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:30:04,047 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:30:04,588 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:30:05,122 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:30:05,657 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:30:06,172 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:30:06,679 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:30:07,211 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:30:07,667 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:30:08,111 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:30:08,547 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:30:08,960 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:30:09,365 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:30:13,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:30:13,310 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-08 14:30:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-08 14:30:13,310 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-08 14:30:13,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:30:13,312 INFO L225 Difference]: With dead ends: 667 [2019-01-08 14:30:13,312 INFO L226 Difference]: Without dead ends: 388 [2019-01-08 14:30:13,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 51.8s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-08 14:30:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-08 14:30:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-08 14:30:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-08 14:30:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-08 14:30:13,421 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-08 14:30:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:30:13,422 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-08 14:30:13,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-08 14:30:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-08 14:30:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-08 14:30:13,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:30:13,423 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-08 14:30:13,423 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:30:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:30:13,423 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-08 14:30:13,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:30:13,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:13,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:30:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:13,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:30:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:30:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:30:16,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:16,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:30:16,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:30:16,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:30:16,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:16,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:30:16,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:30:16,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:30:16,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:30:16,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:30:16,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:30:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:30:20,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:30:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:30:20,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:30:20,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-08 14:30:20,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:30:20,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-08 14:30:20,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-08 14:30:20,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-08 14:30:20,384 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-08 14:30:35,280 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-08 14:30:35,898 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-08 14:30:36,505 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-08 14:30:36,926 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-08 14:30:37,375 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-08 14:30:37,846 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:30:38,252 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:30:38,633 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:30:39,011 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:30:39,381 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:30:39,746 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:30:40,100 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:30:40,464 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:30:40,795 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:30:41,128 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:30:41,443 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:30:41,749 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:30:42,048 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:30:42,338 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:30:42,654 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:30:42,965 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-08 14:30:43,482 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-08 14:30:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:30:45,584 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-08 14:30:45,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-08 14:30:45,584 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-08 14:30:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:30:45,586 INFO L225 Difference]: With dead ends: 544 [2019-01-08 14:30:45,586 INFO L226 Difference]: Without dead ends: 402 [2019-01-08 14:30:45,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-08 14:30:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-08 14:30:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-08 14:30:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-08 14:30:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-08 14:30:45,665 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-08 14:30:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:30:45,665 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-08 14:30:45,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-08 14:30:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-08 14:30:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-08 14:30:45,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:30:45,667 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-08 14:30:45,668 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:30:45,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:30:45,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-08 14:30:45,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:30:45,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:45,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:30:45,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:45,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:30:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:30:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:30:47,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:47,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:30:47,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:30:47,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:30:47,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:47,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:30:47,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:30:47,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:30:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:30:47,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:30:50,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:30:50,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:30:51,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:30:51,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:30:51,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-08 14:30:51,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:30:51,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-08 14:30:51,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-08 14:30:51,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-08 14:30:51,827 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-08 14:30:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:30:55,117 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-08 14:30:55,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-08 14:30:55,117 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-08 14:30:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:30:55,119 INFO L225 Difference]: With dead ends: 555 [2019-01-08 14:30:55,119 INFO L226 Difference]: Without dead ends: 264 [2019-01-08 14:30:55,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 14:30:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-08 14:30:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-08 14:30:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-08 14:30:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-08 14:30:55,194 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-08 14:30:55,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:30:55,194 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-08 14:30:55,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-08 14:30:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-08 14:30:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-08 14:30:55,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:30:55,196 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-08 14:30:55,196 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:30:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:30:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-08 14:30:55,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:30:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:55,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:30:55,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:30:55,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:30:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:30:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:30:58,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:58,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:30:58,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:30:58,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:30:58,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:30:58,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:30:58,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:30:58,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:30:58,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-08 14:30:58,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:30:58,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:31:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:31:07,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:31:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:31:15,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:31:15,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-08 14:31:15,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:31:15,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-08 14:31:15,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-08 14:31:15,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:31:15,806 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-08 14:31:48,530 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-08 14:31:49,351 WARN L181 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-08 14:31:50,140 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-08 14:31:50,864 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-08 14:31:51,545 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-08 14:31:52,217 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-08 14:31:52,868 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:31:53,526 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:31:54,138 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:31:54,771 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-08 14:31:55,360 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-08 14:31:55,953 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-08 14:31:56,504 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-08 14:31:57,040 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-08 14:31:57,568 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-08 14:31:58,072 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-08 14:31:58,572 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-08 14:31:59,038 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-08 14:31:59,529 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-08 14:31:59,990 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-08 14:32:00,403 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-08 14:32:04,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:32:04,983 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-08 14:32:04,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-08 14:32:04,984 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-08 14:32:04,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:32:04,986 INFO L225 Difference]: With dead ends: 705 [2019-01-08 14:32:04,987 INFO L226 Difference]: Without dead ends: 410 [2019-01-08 14:32:04,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 58.2s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-08 14:32:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-08 14:32:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-08 14:32:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-08 14:32:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-08 14:32:05,099 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-08 14:32:05,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:32:05,099 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-08 14:32:05,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-08 14:32:05,099 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-08 14:32:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-08 14:32:05,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:32:05,101 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-08 14:32:05,101 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:32:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:32:05,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-08 14:32:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:32:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:32:05,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:32:05,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:32:05,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:32:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:32:08,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:32:08,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:32:08,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:32:08,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:32:08,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:32:08,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:32:08,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:32:08,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:32:08,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:32:08,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:32:08,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:32:08,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:32:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:32:12,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:32:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:32:12,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:32:12,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-08 14:32:12,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:32:12,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-08 14:32:12,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-08 14:32:12,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-08 14:32:12,639 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-08 14:32:29,641 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-08 14:32:30,367 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-08 14:32:31,017 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-08 14:32:31,488 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-08 14:32:31,956 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-08 14:32:32,403 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-08 14:32:32,838 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-08 14:32:33,261 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-08 14:32:33,686 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-08 14:32:34,099 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-08 14:32:34,499 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149