java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:16:12,031 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:16:12,034 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:16:12,050 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:16:12,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:16:12,052 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:16:12,054 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:16:12,056 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:16:12,058 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:16:12,061 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:16:12,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:16:12,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:16:12,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:16:12,066 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:16:12,073 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:16:12,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:16:12,075 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:16:12,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:16:12,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:16:12,089 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:16:12,090 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:16:12,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:16:12,095 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:16:12,096 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:16:12,096 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:16:12,097 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:16:12,099 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:16:12,100 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:16:12,101 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:16:12,102 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:16:12,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:16:12,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:16:12,105 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:16:12,105 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:16:12,106 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:16:12,107 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:16:12,107 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:16:12,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:16:12,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:16:12,131 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:16:12,135 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:16:12,135 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:16:12,135 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:16:12,135 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:16:12,136 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:16:12,136 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:16:12,136 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:16:12,136 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:16:12,137 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:16:12,137 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:16:12,138 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:16:12,138 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:16:12,138 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:16:12,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:16:12,139 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:16:12,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:16:12,139 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:16:12,139 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:16:12,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:16:12,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:16:12,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:16:12,142 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:16:12,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:16:12,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:16:12,142 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:16:12,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:16:12,143 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:16:12,143 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:16:12,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:16:12,143 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:16:12,144 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:16:12,144 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:16:12,144 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:16:12,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:16:12,144 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:16:12,145 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:16:12,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:16:12,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:16:12,220 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:16:12,222 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:16:12,223 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:16:12,224 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl [2018-12-03 18:16:12,224 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl' [2018-12-03 18:16:12,266 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:16:12,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:16:12,271 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:16:12,271 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:16:12,271 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:16:12,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,307 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:16:12,308 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:16:12,308 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:16:12,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:16:12,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:16:12,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:16:12,312 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:16:12,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,325 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,326 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... [2018-12-03 18:16:12,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:16:12,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:16:12,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:16:12,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:16:12,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:16:12,409 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 18:16:12,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 18:16:12,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 18:16:12,564 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:16:12,565 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:16:12,566 INFO L202 PluginConnector]: Adding new model NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:16:12 BoogieIcfgContainer [2018-12-03 18:16:12,566 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:16:12,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:16:12,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:16:12,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:16:12,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:16:12" (1/2) ... [2018-12-03 18:16:12,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec0f4f3 and model type NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:16:12, skipping insertion in model container [2018-12-03 18:16:12,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:16:12" (2/2) ... [2018-12-03 18:16:12,574 INFO L112 eAbstractionObserver]: Analyzing ICFG NeonAngel01.bpl [2018-12-03 18:16:12,584 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:16:12,592 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:16:12,610 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:16:12,646 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:16:12,646 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:16:12,646 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:16:12,647 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:16:12,647 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:16:12,647 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:16:12,647 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:16:12,648 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:16:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:16:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:16:12,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:12,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:16:12,675 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:12,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 18:16:12,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:12,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:12,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:12,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:12,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:16:12,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 18:16:12,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:16:12,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:16:12,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:16:12,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:16:12,845 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:16:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:12,882 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 18:16:12,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:16:12,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:16:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:12,900 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:16:12,901 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:16:12,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:16:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:16:12,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:16:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:16:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:16:12,946 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:16:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:12,946 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:16:12,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:16:12,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:16:12,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:16:12,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:12,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:16:12,947 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:12,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:12,947 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 18:16:12,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:12,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:12,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:12,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:12,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:13,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:13,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:13,093 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:16:13,095 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 18:16:13,169 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:16:13,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:16:13,516 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:16:13,518 INFO L272 AbstractInterpreter]: Visited 4 different actions 24 times. Merged at 3 different actions 13 times. Widened at 1 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:16:13,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:13,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:16:13,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:13,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:13,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:13,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:13,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:13,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:13,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:13,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 18:16:13,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:13,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 18:16:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 18:16:13,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:16:13,834 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 18:16:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:13,870 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 18:16:13,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 18:16:13,870 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 18:16:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:13,871 INFO L225 Difference]: With dead ends: 8 [2018-12-03 18:16:13,871 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 18:16:13,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:16:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 18:16:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 18:16:13,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 18:16:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 18:16:13,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 18:16:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:13,875 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 18:16:13,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 18:16:13,875 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 18:16:13,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 18:16:13,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:13,876 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 18:16:13,876 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:13,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:13,877 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 18:16:13,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:13,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:13,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:13,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:13,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:13,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:13,966 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:13,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:13,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:13,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:13,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:13,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:13,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 18:16:13,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:13,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:13,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:14,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:14,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 18:16:14,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:14,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:16:14,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:16:14,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:16:14,106 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 18:16:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:14,165 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 18:16:14,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:16:14,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 18:16:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:14,167 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:16:14,167 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:16:14,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 18:16:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:16:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:16:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:16:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:16:14,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 18:16:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:14,175 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:16:14,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:16:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:16:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:16:14,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:14,176 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 18:16:14,176 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:14,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:14,176 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 18:16:14,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:14,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:14,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:14,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:14,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:14,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:14,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:14,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:14,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:14,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:14,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:14,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:14,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:14,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:14,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:14,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:14,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:14,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:14,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:14,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 18:16:14,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:14,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 18:16:14,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 18:16:14,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:16:14,595 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 18:16:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:14,628 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 18:16:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 18:16:14,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 18:16:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:14,630 INFO L225 Difference]: With dead ends: 10 [2018-12-03 18:16:14,630 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 18:16:14,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 18:16:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 18:16:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 18:16:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 18:16:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 18:16:14,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 18:16:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:14,634 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 18:16:14,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 18:16:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 18:16:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 18:16:14,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:14,635 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 18:16:14,636 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:14,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 18:16:14,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:14,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:14,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:14,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:14,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:14,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:14,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:14,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:14,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:14,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:14,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:14,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:14,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:14,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:14,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 18:16:14,933 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:14,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:16:14,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:16:14,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:16:14,935 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 18:16:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:14,956 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 18:16:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:16:14,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 18:16:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:14,958 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:16:14,959 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:16:14,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 18:16:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:16:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:16:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:16:14,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:16:14,963 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 18:16:14,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:14,963 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:16:14,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:16:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:16:14,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:16:14,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:14,964 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 18:16:14,964 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:14,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:14,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 18:16:14,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:14,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:14,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:14,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:15,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:15,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:15,089 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:15,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:15,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:15,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:15,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:15,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:15,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 18:16:15,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:15,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:15,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:15,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:15,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 18:16:15,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:15,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 18:16:15,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 18:16:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:16:15,613 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 18:16:15,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:15,635 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 18:16:15,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 18:16:15,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 18:16:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:15,636 INFO L225 Difference]: With dead ends: 12 [2018-12-03 18:16:15,636 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 18:16:15,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 18:16:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 18:16:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 18:16:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 18:16:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 18:16:15,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 18:16:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:15,640 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 18:16:15,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 18:16:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 18:16:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 18:16:15,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:15,641 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 18:16:15,642 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:15,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 18:16:15,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:15,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:15,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:15,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:15,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:15,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:15,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:15,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:15,880 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:15,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:15,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:15,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:15,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:15,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:15,902 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:15,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:15,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:15,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:16,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:16,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 18:16:16,088 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:16,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:16:16,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:16:16,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:16:16,090 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 18:16:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:16,125 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 18:16:16,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:16:16,126 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 18:16:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:16,126 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:16:16,126 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:16:16,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 18:16:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:16:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:16:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:16:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 18:16:16,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 18:16:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:16,130 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 18:16:16,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:16:16,131 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 18:16:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:16:16,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:16,131 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 18:16:16,132 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:16,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 18:16:16,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:16,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:16,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:16,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:16,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:16,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:16,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:16,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:16,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:16,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:16,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:16,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:16,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:16,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:16,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:16,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:16,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 18:16:16,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:16,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 18:16:16,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 18:16:16,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:16:16,671 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 18:16:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:16,708 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 18:16:16,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 18:16:16,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 18:16:16,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:16,711 INFO L225 Difference]: With dead ends: 14 [2018-12-03 18:16:16,711 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 18:16:16,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 18:16:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 18:16:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 18:16:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 18:16:16,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 18:16:16,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 18:16:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:16,714 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 18:16:16,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 18:16:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 18:16:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 18:16:16,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:16,715 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 18:16:16,715 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:16,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:16,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 18:16:16,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:16,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:16,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:16,827 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:16,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:16,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:16,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:16,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:16,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:16,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:16,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:16,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:16,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 18:16:16,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:16,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:16,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:17,127 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:17,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:17,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 18:16:17,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:17,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:16:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:16:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:16:17,150 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 18:16:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:17,209 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 18:16:17,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:16:17,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 18:16:17,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:17,210 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:16:17,210 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:16:17,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 18:16:17,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:16:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:16:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:16:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:16:17,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 18:16:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:17,214 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:16:17,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:16:17,215 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:16:17,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:16:17,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:17,215 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 18:16:17,216 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:17,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:17,216 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 18:16:17,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:17,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:17,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:17,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:17,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:17,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:17,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:17,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:17,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:17,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:17,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:17,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:17,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:17,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:17,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:17,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:17,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:17,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:17,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:17,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 18:16:17,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:17,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 18:16:17,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 18:16:17,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:16:17,719 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 18:16:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:17,777 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 18:16:17,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 18:16:17,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 18:16:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:17,779 INFO L225 Difference]: With dead ends: 16 [2018-12-03 18:16:17,779 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 18:16:17,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 18:16:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 18:16:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 18:16:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 18:16:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 18:16:17,784 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 18:16:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:17,784 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 18:16:17,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 18:16:17,785 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 18:16:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 18:16:17,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:17,785 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 18:16:17,785 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:17,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 18:16:17,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:17,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:17,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:17,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:17,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:17,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:17,963 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:17,963 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:17,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:17,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:17,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:17,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:17,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:17,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:17,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:18,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:18,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 18:16:18,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:18,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:16:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:16:18,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:16:18,261 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 18:16:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:18,312 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 18:16:18,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:16:18,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 18:16:18,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:18,313 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:16:18,313 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:16:18,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 18:16:18,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:16:18,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 18:16:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 18:16:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 18:16:18,318 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 18:16:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:18,319 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 18:16:18,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:16:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 18:16:18,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:16:18,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:18,319 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 18:16:18,319 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:18,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:18,320 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 18:16:18,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:18,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:18,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:18,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:18,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:18,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:18,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:18,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:18,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:18,522 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:18,522 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:18,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 18:16:18,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:18,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:18,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:19,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 18:16:19,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:19,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 18:16:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 18:16:19,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:16:19,077 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 18:16:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:19,117 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 18:16:19,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 18:16:19,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 18:16:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:19,118 INFO L225 Difference]: With dead ends: 18 [2018-12-03 18:16:19,118 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 18:16:19,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 18:16:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 18:16:19,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 18:16:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 18:16:19,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 18:16:19,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 18:16:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:19,122 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 18:16:19,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 18:16:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 18:16:19,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 18:16:19,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:19,123 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 18:16:19,123 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:19,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:19,123 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 18:16:19,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:19,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:19,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:19,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:19,370 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:19,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:19,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:19,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:19,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:19,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:19,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:19,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:19,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:19,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:19,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:19,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:19,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:19,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:19,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 18:16:19,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:19,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:16:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:16:19,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:16:19,669 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 18:16:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:19,825 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 18:16:19,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:16:19,826 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 18:16:19,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:19,826 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:16:19,826 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:16:19,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 18:16:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:16:19,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 18:16:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:16:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 18:16:19,834 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 18:16:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:19,834 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 18:16:19,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:16:19,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 18:16:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:16:19,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:19,835 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 18:16:19,835 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:19,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 18:16:19,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:19,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:19,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:19,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:20,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:20,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:20,110 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:20,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:20,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:20,110 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:20,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:20,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:20,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:20,139 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:20,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:20,525 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:20,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:20,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 18:16:20,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:20,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 18:16:20,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 18:16:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:16:20,547 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 18:16:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:20,581 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 18:16:20,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 18:16:20,582 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 18:16:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:20,583 INFO L225 Difference]: With dead ends: 20 [2018-12-03 18:16:20,583 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 18:16:20,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 18:16:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 18:16:20,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 18:16:20,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 18:16:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 18:16:20,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 18:16:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:20,589 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 18:16:20,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 18:16:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 18:16:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 18:16:20,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:20,589 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 18:16:20,590 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:20,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 18:16:20,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:20,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:20,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:20,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:20,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:20,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:20,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:20,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:20,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:20,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:20,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:21,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 18:16:21,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:21,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:21,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:21,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:21,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 18:16:21,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:21,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:16:21,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:16:21,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:16:21,607 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 18:16:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:21,657 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 18:16:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:16:21,658 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 18:16:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:21,658 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:16:21,659 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:16:21,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 18:16:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:16:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 18:16:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:16:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 18:16:21,663 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 18:16:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:21,663 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 18:16:21,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:16:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 18:16:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:16:21,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:21,665 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 18:16:21,665 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:21,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:21,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 18:16:21,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:21,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:21,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:21,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:21,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:21,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:21,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:21,977 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:21,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:21,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:21,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:21,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:21,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:21,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:21,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:22,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:22,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:22,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:22,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 18:16:22,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:22,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 18:16:22,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 18:16:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:16:22,501 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 18:16:22,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:22,690 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 18:16:22,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 18:16:22,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 18:16:22,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:22,692 INFO L225 Difference]: With dead ends: 22 [2018-12-03 18:16:22,692 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 18:16:22,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 18:16:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 18:16:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 18:16:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 18:16:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 18:16:22,697 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 18:16:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:22,697 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 18:16:22,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 18:16:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 18:16:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 18:16:22,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:22,698 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 18:16:22,698 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:22,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:22,698 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 18:16:22,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:22,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:22,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:23,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:23,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:23,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:23,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:23,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:23,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:23,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:23,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:23,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:23,660 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:23,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 18:16:24,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:24,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:16:24,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:16:24,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:16:24,453 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 18:16:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:24,486 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 18:16:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:16:24,487 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 18:16:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:24,488 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:16:24,488 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:16:24,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 18:16:24,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:16:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:16:24,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:16:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 18:16:24,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 18:16:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:24,493 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 18:16:24,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:16:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 18:16:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:16:24,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:24,494 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 18:16:24,494 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:24,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 18:16:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:24,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:24,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:24,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:24,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:24,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:24,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:24,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:24,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:24,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:24,792 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:25,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 18:16:25,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:25,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:25,554 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:25,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:26,483 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:26,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:26,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 18:16:26,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:26,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 18:16:26,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 18:16:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:16:26,505 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 18:16:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:26,549 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 18:16:26,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 18:16:26,551 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 18:16:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:26,551 INFO L225 Difference]: With dead ends: 24 [2018-12-03 18:16:26,551 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 18:16:26,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 18:16:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 18:16:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 18:16:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 18:16:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 18:16:26,557 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 18:16:26,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:26,557 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 18:16:26,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 18:16:26,558 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 18:16:26,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 18:16:26,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:26,559 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 18:16:26,559 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:26,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 18:16:26,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:26,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:26,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:26,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:27,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:27,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:27,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:27,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:27,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:27,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:27,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:27,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:27,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:27,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:27,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:27,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:27,820 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:27,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:27,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 18:16:27,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:27,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:16:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:16:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:16:27,842 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 18:16:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:27,876 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 18:16:27,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:16:27,876 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 18:16:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:27,876 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:16:27,877 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:16:27,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 18:16:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:16:27,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 18:16:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 18:16:27,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 18:16:27,881 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 18:16:27,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:27,882 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 18:16:27,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:16:27,882 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 18:16:27,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:16:27,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:27,883 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 18:16:27,883 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:27,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:27,883 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 18:16:27,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:27,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:27,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:28,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:28,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:28,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:28,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:28,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:28,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:28,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:28,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:28,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:28,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:28,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:28,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 18:16:28,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:28,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 18:16:28,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 18:16:28,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:16:28,732 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 18:16:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:28,794 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 18:16:28,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 18:16:28,795 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 18:16:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:28,796 INFO L225 Difference]: With dead ends: 26 [2018-12-03 18:16:28,796 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 18:16:28,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 18:16:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 18:16:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 18:16:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 18:16:28,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 18:16:28,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 18:16:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:28,801 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 18:16:28,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 18:16:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 18:16:28,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 18:16:28,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:28,802 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 18:16:28,802 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:28,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:28,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 18:16:28,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:28,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:28,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:28,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:28,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:29,122 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:29,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:29,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:29,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:29,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:29,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:29,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:29,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:29,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:29,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 18:16:29,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:29,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:29,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:29,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:29,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 18:16:29,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:29,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:16:29,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:16:29,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:16:29,903 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 18:16:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:29,969 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 18:16:29,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:16:29,969 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 18:16:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:29,972 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:16:29,972 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:16:29,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 18:16:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:16:29,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 18:16:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:16:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 18:16:29,977 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 18:16:29,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:29,977 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 18:16:29,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:16:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 18:16:29,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:16:29,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:29,979 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 18:16:29,979 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:29,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:29,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 18:16:29,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:29,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:29,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:29,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:30,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:30,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:30,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:30,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:30,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:30,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:30,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:16:30,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:16:30,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:16:30,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:30,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:30,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:31,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:31,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 18:16:31,211 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:31,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 18:16:31,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 18:16:31,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:16:31,212 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 18:16:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:31,249 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 18:16:31,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 18:16:31,252 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 18:16:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:31,253 INFO L225 Difference]: With dead ends: 28 [2018-12-03 18:16:31,253 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 18:16:31,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 18:16:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 18:16:31,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 18:16:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 18:16:31,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 18:16:31,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 18:16:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:31,257 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 18:16:31,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 18:16:31,258 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 18:16:31,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 18:16:31,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:31,258 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 18:16:31,258 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:31,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:31,259 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 18:16:31,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:31,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:31,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:16:31,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:31,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:31,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:31,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:31,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:31,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:31,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:31,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:31,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:31,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:16:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:31,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:31,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:32,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:32,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 18:16:32,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:32,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:16:32,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:16:32,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:16:32,197 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 18:16:32,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:32,248 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 18:16:32,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:16:32,249 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 18:16:32,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:32,250 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:16:32,250 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:16:32,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 18:16:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:16:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 18:16:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 18:16:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 18:16:32,255 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 18:16:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:32,255 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 18:16:32,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:16:32,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 18:16:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:16:32,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:32,256 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 18:16:32,256 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:32,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:32,256 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 18:16:32,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:32,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:32,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:32,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:32,258 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:32,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:32,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:32,580 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:32,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:32,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:32,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:16:32,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:32,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:13,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 18:17:13,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:13,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:13,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:14,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:14,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 18:17:14,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:14,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 18:17:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 18:17:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:17:14,445 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 18:17:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:14,489 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 18:17:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 18:17:14,489 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 18:17:14,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:14,490 INFO L225 Difference]: With dead ends: 30 [2018-12-03 18:17:14,490 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 18:17:14,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 18:17:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 18:17:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 18:17:14,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 18:17:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 18:17:14,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 18:17:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:14,496 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 18:17:14,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 18:17:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 18:17:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 18:17:14,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:14,497 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 18:17:14,498 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:14,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:14,498 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 18:17:14,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:14,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:14,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:14,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:14,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:15,114 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:15,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:15,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:15,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:15,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:15,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:15,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:15,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:15,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:15,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:15,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:15,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:15,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:16,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:16,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 18:17:16,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:16,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:17:16,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:17:16,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:17:16,102 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 18:17:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:16,166 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 18:17:16,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:17:16,166 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 18:17:16,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:16,167 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:17:16,167 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:17:16,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 18:17:16,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:17:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 18:17:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:17:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 18:17:16,171 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 18:17:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:16,172 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 18:17:16,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:17:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 18:17:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:17:16,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:16,173 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 18:17:16,173 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:16,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:16,173 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 18:17:16,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:16,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:16,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:17,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:17,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:17,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:17,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:17,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:17,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:17,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:17,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:17,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:17,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:19,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:19,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 18:17:19,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:19,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 18:17:19,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 18:17:19,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:17:19,315 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 18:17:19,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:19,368 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 18:17:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 18:17:19,368 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 18:17:19,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:19,368 INFO L225 Difference]: With dead ends: 32 [2018-12-03 18:17:19,368 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 18:17:19,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 18:17:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 18:17:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 18:17:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 18:17:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 18:17:19,372 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 18:17:19,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:19,372 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 18:17:19,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 18:17:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 18:17:19,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 18:17:19,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:19,373 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 18:17:19,373 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:19,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:19,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 18:17:19,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:19,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:19,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:19,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:19,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:20,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:20,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:20,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:20,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:20,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:20,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:20,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:20,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:17:27,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 18:17:27,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:27,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:27,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:28,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:28,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 18:17:28,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:28,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:17:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:17:28,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:17:28,757 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 18:17:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:28,907 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 18:17:28,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:17:28,908 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 18:17:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:28,908 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:17:28,908 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:17:28,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 18:17:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:17:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:17:28,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:17:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 18:17:28,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 18:17:28,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:28,914 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 18:17:28,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:17:28,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 18:17:28,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:17:28,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:28,914 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 18:17:28,915 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:28,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:28,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 18:17:28,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:28,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:28,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:28,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:28,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:29,523 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:29,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:29,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:29,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:29,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:29,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:29,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:29,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:17:29,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:17:29,553 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:17:29,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:17:29,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:29,562 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:29,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:30,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:30,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 18:17:30,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:30,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 18:17:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 18:17:30,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:17:30,448 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 18:17:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:30,492 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 18:17:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 18:17:30,493 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 18:17:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:30,493 INFO L225 Difference]: With dead ends: 34 [2018-12-03 18:17:30,494 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 18:17:30,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 18:17:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 18:17:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 18:17:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 18:17:30,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 18:17:30,498 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 18:17:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:30,499 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 18:17:30,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 18:17:30,499 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 18:17:30,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 18:17:30,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:30,500 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 18:17:30,500 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:30,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:30,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 18:17:30,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:30,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:17:30,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:30,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:31,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:31,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:31,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:31,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:31,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:31,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:31,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:31,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:17:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:31,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:17:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:31,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:17:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:32,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:17:32,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 18:17:32,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:17:32,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:17:32,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:17:32,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:17:32,282 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 18:17:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:17:32,353 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 18:17:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:17:32,354 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 18:17:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:17:32,354 INFO L225 Difference]: With dead ends: 35 [2018-12-03 18:17:32,355 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:17:32,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 18:17:32,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:17:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 18:17:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:17:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 18:17:32,361 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 18:17:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:17:32,361 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 18:17:32,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:17:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 18:17:32,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 18:17:32,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:17:32,362 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 18:17:32,362 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:17:32,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:17:32,362 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 18:17:32,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:17:32,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:32,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:17:32,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:17:32,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:17:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:17:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:17:32,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:32,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:17:32,783 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:17:32,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:17:32,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:17:32,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:17:32,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:17:32,792 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:18:39,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 18:18:39,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:39,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:39,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:41,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:41,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 18:18:41,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:41,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 18:18:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 18:18:41,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:18:41,120 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 18:18:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:41,161 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 18:18:41,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 18:18:41,162 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 18:18:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:41,163 INFO L225 Difference]: With dead ends: 36 [2018-12-03 18:18:41,163 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 18:18:41,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 18:18:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 18:18:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 18:18:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 18:18:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 18:18:41,166 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 18:18:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:41,167 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 18:18:41,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 18:18:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 18:18:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 18:18:41,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:41,167 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 18:18:41,168 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:41,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:41,168 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 18:18:41,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:41,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:41,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:41,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:41,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:41,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:41,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:41,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:41,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:41,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:41,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:41,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:41,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:41,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:41,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:41,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:41,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:42,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:42,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 18:18:42,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:42,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:18:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:18:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:18:42,912 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 18:18:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:42,957 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 18:18:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:18:42,957 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 18:18:42,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:42,958 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:18:42,958 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:18:42,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 18:18:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:18:42,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 18:18:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 18:18:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 18:18:42,962 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 18:18:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:42,963 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 18:18:42,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:18:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 18:18:42,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:18:42,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:42,964 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 18:18:42,964 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:42,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:42,964 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 18:18:42,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:42,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:42,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:42,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:42,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:43,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:43,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:43,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:43,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:43,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:43,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:43,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:43,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:18:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:43,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:18:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:43,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:45,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:45,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 18:18:45,091 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:45,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 18:18:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 18:18:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:18:45,092 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 18:18:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:45,181 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 18:18:45,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 18:18:45,181 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 18:18:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:45,182 INFO L225 Difference]: With dead ends: 38 [2018-12-03 18:18:45,182 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 18:18:45,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 18:18:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 18:18:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 18:18:45,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 18:18:45,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 18:18:45,186 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 18:18:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:45,187 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 18:18:45,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 18:18:45,187 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 18:18:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 18:18:45,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:45,187 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 18:18:45,188 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:45,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 18:18:45,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:45,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:45,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:18:45,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:45,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:45,683 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:45,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:45,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:45,684 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:45,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:45,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:45,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:18:45,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:18:45,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:19:51,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 18:19:51,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:51,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:51,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:52,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:52,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 18:19:52,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:52,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:19:52,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:19:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:19:52,678 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 18:19:52,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:52,758 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 18:19:52,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:19:52,759 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 18:19:52,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:52,759 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:19:52,759 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:19:52,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 18:19:52,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:19:52,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:19:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:19:52,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 18:19:52,763 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 18:19:52,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:52,764 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 18:19:52,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:19:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 18:19:52,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 18:19:52,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:52,764 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 18:19:52,765 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:52,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:52,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 18:19:52,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:52,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:52,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:52,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:52,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:53,278 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:53,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:53,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:53,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:53,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:53,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:53,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:53,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:19:53,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:19:53,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:19:53,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:19:53,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:53,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:54,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:54,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 18:19:54,568 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:54,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 18:19:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 18:19:54,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:19:54,570 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 18:19:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:54,656 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 18:19:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 18:19:54,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 18:19:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:54,657 INFO L225 Difference]: With dead ends: 40 [2018-12-03 18:19:54,658 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 18:19:54,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 18:19:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 18:19:54,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 18:19:54,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 18:19:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 18:19:54,661 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 18:19:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:54,661 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 18:19:54,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 18:19:54,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 18:19:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 18:19:54,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:54,662 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 18:19:54,662 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:54,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:54,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 18:19:54,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:54,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:19:54,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:54,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:55,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:55,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:55,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:55,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:55,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:55,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:55,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:55,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:19:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:55,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:55,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:19:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:56,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:19:56,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 18:19:56,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:19:56,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:19:56,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:19:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:19:56,913 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 18:19:56,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:19:56,987 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 18:19:56,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:19:56,987 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 18:19:56,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:19:56,988 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:19:56,988 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:19:56,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 18:19:56,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:19:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 18:19:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 18:19:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 18:19:56,992 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 18:19:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:19:56,992 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 18:19:56,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:19:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 18:19:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:19:56,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:19:56,993 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 18:19:56,994 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:19:56,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:19:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 18:19:56,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:19:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:56,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:19:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:19:56,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:19:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:19:57,559 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:57,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:57,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:19:57,560 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:19:57,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:19:57,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:19:57,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:19:57,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:19:57,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:21:14,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 18:21:14,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:14,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:14,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:15,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:15,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 18:21:15,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:15,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 18:21:15,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 18:21:15,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:21:15,686 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 18:21:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:15,743 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 18:21:15,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 18:21:15,743 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 18:21:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:15,744 INFO L225 Difference]: With dead ends: 42 [2018-12-03 18:21:15,744 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 18:21:15,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 18:21:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 18:21:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 18:21:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 18:21:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 18:21:15,747 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 18:21:15,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:15,747 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 18:21:15,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 18:21:15,747 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 18:21:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 18:21:15,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:15,748 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 18:21:15,748 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:15,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 18:21:15,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:15,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:15,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:16,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:16,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:16,376 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:16,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:16,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:16,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:16,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:21:16,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:21:16,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:21:16,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:21:16,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:16,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:18,339 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:18,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:18,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 18:21:18,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:18,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:21:18,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:21:18,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:21:18,360 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 18:21:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:18,420 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 18:21:18,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:21:18,420 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 18:21:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:18,421 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:21:18,421 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:21:18,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 18:21:18,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:21:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 18:21:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:21:18,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 18:21:18,424 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 18:21:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:18,425 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 18:21:18,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:21:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 18:21:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 18:21:18,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:18,425 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 18:21:18,426 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:18,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 18:21:18,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:18,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:21:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:18,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:19,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:19,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:19,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:19,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:19,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:19,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:19,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:19,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:21:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:19,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:21:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:19,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:21:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:20,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:21:20,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 18:21:20,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:21:20,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 18:21:20,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 18:21:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:21:20,710 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 18:21:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:21:20,774 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 18:21:20,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 18:21:20,774 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 18:21:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:21:20,775 INFO L225 Difference]: With dead ends: 44 [2018-12-03 18:21:20,775 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 18:21:20,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 18:21:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 18:21:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 18:21:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 18:21:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 18:21:20,778 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 18:21:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:21:20,778 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 18:21:20,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 18:21:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 18:21:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 18:21:20,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:21:20,779 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 18:21:20,779 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:21:20,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:21:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 18:21:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:21:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:20,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:21:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:21:20,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:21:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:21:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:21:22,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:22,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:21:22,740 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:21:22,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:21:22,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:21:22,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:21:22,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:21:22,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:22:49,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 18:22:49,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:50,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:50,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:52,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:52,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 18:22:52,069 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:52,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:22:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:22:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:22:52,070 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 18:22:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:52,140 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 18:22:52,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:22:52,141 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 18:22:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:52,141 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:22:52,141 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:22:52,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 18:22:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:22:52,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 18:22:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:22:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 18:22:52,145 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 18:22:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:52,145 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 18:22:52,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:22:52,146 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 18:22:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 18:22:52,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:52,146 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 18:22:52,146 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:52,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:52,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 18:22:52,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:52,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:52,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:52,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:52,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:52,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:52,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:52,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:52,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:52,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:52,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:52,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:22:52,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:22:52,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:22:52,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:22:52,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:52,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:54,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:54,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 18:22:54,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:54,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 18:22:54,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 18:22:54,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:22:54,626 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 18:22:54,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:54,682 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 18:22:54,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 18:22:54,682 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 18:22:54,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:54,683 INFO L225 Difference]: With dead ends: 46 [2018-12-03 18:22:54,683 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 18:22:54,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 18:22:54,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 18:22:54,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 18:22:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 18:22:54,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 18:22:54,686 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 18:22:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:54,686 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 18:22:54,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 18:22:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 18:22:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 18:22:54,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:54,687 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 18:22:54,687 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:54,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:54,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 18:22:54,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:54,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:22:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:54,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:54,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:55,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:55,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:55,383 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:55,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:55,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:55,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:55,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:55,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:22:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:55,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:22:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:55,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:22:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:57,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:22:57,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 18:22:57,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:22:57,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:22:57,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:22:57,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:22:57,204 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 18:22:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:22:57,294 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 18:22:57,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:22:57,295 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 18:22:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:22:57,296 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:22:57,296 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 18:22:57,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 18:22:57,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 18:22:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 18:22:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 18:22:57,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 18:22:57,300 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 18:22:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:22:57,301 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 18:22:57,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:22:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 18:22:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:22:57,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:22:57,301 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 18:22:57,302 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:22:57,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:22:57,302 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 18:22:57,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:22:57,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:57,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:22:57,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:22:57,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:22:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:22:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:22:57,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:57,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:22:57,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:22:57,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:22:57,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:22:57,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:22:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:22:57,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:25:01,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 18:25:01,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:02,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:02,238 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:02,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:04,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:04,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 18:25:04,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:04,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 18:25:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 18:25:04,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:25:04,161 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 18:25:04,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:04,231 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 18:25:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 18:25:04,231 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 18:25:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:04,232 INFO L225 Difference]: With dead ends: 48 [2018-12-03 18:25:04,232 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 18:25:04,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 18:25:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 18:25:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 18:25:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 18:25:04,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 18:25:04,235 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 18:25:04,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:04,236 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 18:25:04,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 18:25:04,236 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 18:25:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 18:25:04,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:04,236 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 18:25:04,236 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:04,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:04,237 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 18:25:04,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:04,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:25:04,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:04,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:05,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:05,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:05,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:05,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:05,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:05,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:05,009 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:25:05,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:25:05,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:25:05,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:25:05,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:05,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:07,031 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:07,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:07,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 18:25:07,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:07,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:25:07,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:25:07,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:25:07,053 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 18:25:07,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:07,104 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 18:25:07,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:25:07,105 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 18:25:07,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:07,105 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:25:07,106 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:25:07,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 18:25:07,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:25:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 18:25:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 18:25:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 18:25:07,109 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 18:25:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:07,110 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 18:25:07,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:25:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 18:25:07,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 18:25:07,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:07,110 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 18:25:07,110 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:07,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:07,111 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 18:25:07,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:07,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:07,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:25:07,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:07,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:07,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:07,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:07,899 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:07,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:07,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:07,899 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:07,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:25:07,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:25:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:07,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:25:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:07,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:25:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:09,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:25:09,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 18:25:09,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:25:09,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 18:25:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 18:25:09,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:25:09,962 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 18:25:10,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:25:10,059 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 18:25:10,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 18:25:10,060 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 18:25:10,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:25:10,060 INFO L225 Difference]: With dead ends: 50 [2018-12-03 18:25:10,061 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 18:25:10,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 18:25:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 18:25:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 18:25:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 18:25:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 18:25:10,064 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 18:25:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:25:10,064 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 18:25:10,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 18:25:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 18:25:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 18:25:10,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:25:10,065 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 18:25:10,065 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:25:10,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:25:10,066 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 18:25:10,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:25:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:10,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:25:10,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:25:10,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:25:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:25:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:25:10,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:10,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:25:10,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:25:10,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:25:10,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:25:10,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:25:10,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:25:10,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:27:38,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 18:27:38,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:27:39,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:39,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:41,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:41,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 18:27:41,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:41,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:27:41,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:27:41,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:27:41,363 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 18:27:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:41,414 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 18:27:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:27:41,414 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 18:27:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:41,415 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:27:41,415 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 18:27:41,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 18:27:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 18:27:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 18:27:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 18:27:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 18:27:41,419 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 18:27:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:41,420 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 18:27:41,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:27:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 18:27:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 18:27:41,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:41,421 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 18:27:41,421 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:41,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 18:27:41,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:41,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:27:41,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:41,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:42,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:42,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:42,255 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:42,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:42,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:42,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:27:42,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:27:42,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:27:42,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:27:42,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:27:42,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:42,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:44,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:44,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 18:27:44,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:44,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 18:27:44,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 18:27:44,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:27:44,474 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 18:27:44,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:44,818 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 18:27:44,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 18:27:44,819 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 18:27:44,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:44,820 INFO L225 Difference]: With dead ends: 52 [2018-12-03 18:27:44,820 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 18:27:44,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 18:27:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 18:27:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 18:27:44,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 18:27:44,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 18:27:44,823 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 18:27:44,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:44,823 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 18:27:44,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 18:27:44,823 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 18:27:44,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 18:27:44,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:44,824 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 18:27:44,824 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:44,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:44,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 18:27:44,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:44,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:27:44,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:44,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:46,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:46,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:46,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:46,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:46,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:46,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:27:46,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:27:46,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:27:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:46,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:27:46,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:46,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:27:48,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:48,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:27:48,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 18:27:48,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:27:48,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:27:48,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:27:48,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:27:48,405 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 18:27:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:27:48,500 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 18:27:48,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:27:48,500 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 18:27:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:27:48,501 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:27:48,501 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:27:48,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 18:27:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:27:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 18:27:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:27:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 18:27:48,504 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 18:27:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:27:48,504 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 18:27:48,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:27:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 18:27:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:27:48,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:27:48,505 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 18:27:48,505 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:27:48,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:27:48,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 18:27:48,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:27:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:48,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:27:48,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:27:48,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:27:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:27:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:27:49,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:49,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:27:49,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:27:49,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:27:49,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:27:49,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:27:49,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:27:49,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:29:42,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 18:29:42,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:29:42,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:29:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:42,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:29:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:44,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:29:44,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 18:29:44,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:29:44,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 18:29:44,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 18:29:44,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:29:44,733 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 18:29:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:29:44,807 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 18:29:44,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 18:29:44,810 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 18:29:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:29:44,811 INFO L225 Difference]: With dead ends: 54 [2018-12-03 18:29:44,811 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 18:29:44,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 18:29:44,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 18:29:44,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 18:29:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 18:29:44,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 18:29:44,814 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 18:29:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:29:44,814 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 18:29:44,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 18:29:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 18:29:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 18:29:44,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:29:44,815 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 18:29:44,815 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:29:44,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:29:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 18:29:44,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:29:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:44,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:29:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:44,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:29:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:29:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:45,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:45,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:29:45,727 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:29:45,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:29:45,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:45,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:29:45,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:29:45,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:29:45,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:29:45,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:29:45,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:29:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:45,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:29:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:48,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:29:48,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 18:29:48,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:29:48,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:29:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:29:48,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:29:48,211 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 18:29:48,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:29:48,341 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 18:29:48,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:29:48,342 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 18:29:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:29:48,343 INFO L225 Difference]: With dead ends: 55 [2018-12-03 18:29:48,343 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:29:48,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 18:29:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:29:48,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:29:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:29:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 18:29:48,347 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 18:29:48,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:29:48,348 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 18:29:48,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:29:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 18:29:48,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:29:48,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:29:48,348 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 18:29:48,349 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:29:48,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:29:48,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 18:29:48,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:29:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:48,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:29:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:48,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:29:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:29:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:49,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:49,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:29:49,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:29:49,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:29:49,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:49,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:29:49,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:29:49,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:29:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:29:49,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:29:49,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:49,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:29:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:52,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:29:52,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 18:29:52,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:29:52,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 18:29:52,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 18:29:52,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:29:52,167 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 18:29:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:29:52,249 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 18:29:52,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 18:29:52,250 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 18:29:52,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:29:52,251 INFO L225 Difference]: With dead ends: 56 [2018-12-03 18:29:52,251 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 18:29:52,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 18:29:52,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 18:29:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 18:29:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 18:29:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 18:29:52,254 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 18:29:52,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:29:52,255 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 18:29:52,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 18:29:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 18:29:52,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 18:29:52,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:29:52,255 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 18:29:52,255 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:29:52,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:29:52,256 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 18:29:52,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:29:52,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:52,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:29:52,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:29:52,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:29:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:29:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:29:53,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:53,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:29:53,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:29:53,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:29:53,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:29:53,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 18:29:53,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:29:53,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)