java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:41:17,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:41:18,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:41:18,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:41:18,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:41:18,020 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:41:18,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:41:18,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:41:18,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:41:18,035 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:41:18,036 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:41:18,036 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:41:18,040 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:41:18,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:41:18,046 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:41:18,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:41:18,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:41:18,052 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:41:18,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:41:18,058 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:41:18,059 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:41:18,060 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:41:18,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:41:18,063 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:41:18,063 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:41:18,064 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:41:18,067 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:41:18,068 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:41:18,069 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:41:18,070 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:41:18,070 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:41:18,075 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:41:18,076 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:41:18,076 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:41:18,077 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:41:18,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:41:18,079 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-28 10:41:18,103 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:41:18,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:41:18,105 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:41:18,105 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:41:18,105 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:41:18,105 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:41:18,106 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:41:18,106 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:41:18,106 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:41:18,106 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 10:41:18,106 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 10:41:18,107 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:41:18,107 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:41:18,109 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:41:18,109 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:41:18,109 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:41:18,109 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:41:18,109 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:41:18,110 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:41:18,110 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:41:18,110 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:41:18,110 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:41:18,110 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:41:18,111 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:41:18,112 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:41:18,112 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:41:18,113 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:41:18,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:41:18,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:41:18,113 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:41:18,113 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:41:18,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:41:18,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:41:18,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:41:18,115 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:41:18,115 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:41:18,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:41:18,116 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:41:18,116 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:41:18,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:41:18,176 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:41:18,183 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:41:18,184 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:41:18,187 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:41:18,188 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2019-02-28 10:41:18,189 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2019-02-28 10:41:18,246 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:41:18,248 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:41:18,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:41:18,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:41:18,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:41:18,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,303 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:41:18,304 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:41:18,304 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:41:18,304 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:41:18,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/1) ... [2019-02-28 10:41:18,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:41:18,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:41:18,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:41:18,329 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:41:18,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:41:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:41:18,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:41:18,742 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:41:18,742 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-28 10:41:18,743 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:41:18 BoogieIcfgContainer [2019-02-28 10:41:18,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:41:18,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:41:18,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:41:18,751 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:41:18,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:41:18" (1/2) ... [2019-02-28 10:41:18,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19253e3f and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:41:18, skipping insertion in model container [2019-02-28 10:41:18,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:41:18" (2/2) ... [2019-02-28 10:41:18,759 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2019-02-28 10:41:18,780 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:41:18,803 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 10:41:18,846 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 10:41:18,887 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:41:18,887 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:41:18,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:41:18,888 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:41:18,888 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:41:18,888 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:41:18,888 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:41:18,888 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:41:18,904 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-28 10:41:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:41:18,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:18,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:41:18,922 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:41:18,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:18,930 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2019-02-28 10:41:18,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:18,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:18,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:18,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:18,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:19,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:41:19,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:41:19,150 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:41:19,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:41:19,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:41:19,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:41:19,167 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-02-28 10:41:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:19,276 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-02-28 10:41:19,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:41:19,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:41:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:19,290 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:41:19,290 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:41:19,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:41:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:41:19,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-02-28 10:41:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:41:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-02-28 10:41:19,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-02-28 10:41:19,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:19,330 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-02-28 10:41:19,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:41:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-02-28 10:41:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:41:19,331 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:19,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-28 10:41:19,332 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:41:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2019-02-28 10:41:19,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:19,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:19,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:19,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:19,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:19,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:19,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:41:19,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:41:19,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:41:19,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:41:19,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:41:19,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:41:19,487 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-02-28 10:41:19,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:19,684 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-02-28 10:41:19,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:41:19,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-28 10:41:19,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:19,686 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:41:19,686 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:41:19,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-28 10:41:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:41:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-02-28 10:41:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:41:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-28 10:41:19,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2019-02-28 10:41:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:19,694 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-28 10:41:19,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:41:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-28 10:41:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:41:19,695 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:19,695 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-28 10:41:19,696 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:41:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2019-02-28 10:41:19,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:19,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:19,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:19,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:19,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:19,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:41:19,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-28 10:41:19,789 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:41:19,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:41:19,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:41:19,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:41:19,791 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-02-28 10:41:19,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:41:19,832 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-02-28 10:41:19,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:41:19,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-28 10:41:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:41:19,834 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:41:19,834 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:41:19,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:41:19,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:41:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:41:19,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:41:19,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-28 10:41:19,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-02-28 10:41:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:41:19,839 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-28 10:41:19,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:41:19,839 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-28 10:41:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 10:41:19,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:41:19,840 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-02-28 10:41:19,840 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:41:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:41:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2019-02-28 10:41:19,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:41:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:19,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:41:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:41:19,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:41:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:41:20,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:41:20,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:41:20,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:41:20,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-02-28 10:41:20,098 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [9], [11], [12], [13], [21] [2019-02-28 10:41:20,165 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 10:41:20,166 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:42:01,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:42:01,024 INFO L272 AbstractInterpreter]: Visited 8 different actions 86 times. Merged at 6 different actions 78 times. Widened at 1 different actions 9 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:42:01,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:01,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:42:01,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:01,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:01,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:01,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:01,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:42:01,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:01,142 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:01,142 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:01,177 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:01,177 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:01,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:01,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:01,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-28 10:42:01,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:01,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:42:01,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:42:01,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:42:01,450 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-02-28 10:42:01,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:01,719 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-28 10:42:01,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:42:01,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-02-28 10:42:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:01,720 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:42:01,720 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:42:01,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-28 10:42:01,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:42:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-28 10:42:01,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:42:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-28 10:42:01,729 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2019-02-28 10:42:01,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:01,730 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-28 10:42:01,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:42:01,730 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-28 10:42:01,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:42:01,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:01,731 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-02-28 10:42:01,731 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:01,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:01,732 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2019-02-28 10:42:01,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:01,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:01,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:01,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:01,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:01,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:01,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:01,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:01,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:01,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:01,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:01,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:01,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:01,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-28 10:42:01,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:01,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-28 10:42:01,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:01,986 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:01,986 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:02,013 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:02,014 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:02,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:02,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:02,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:02,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-02-28 10:42:02,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:02,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:42:02,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:42:02,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:42:02,520 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-02-28 10:42:02,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:02,693 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-28 10:42:02,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:42:02,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-02-28 10:42:02,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:02,694 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:42:02,694 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:42:02,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:42:02,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:42:02,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-02-28 10:42:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:42:02,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-28 10:42:02,700 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2019-02-28 10:42:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:02,700 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-28 10:42:02,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:42:02,700 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-28 10:42:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-28 10:42:02,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:02,701 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2019-02-28 10:42:02,702 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2019-02-28 10:42:02,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:02,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:02,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:02,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:02,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:02,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:02,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:02,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:02,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:02,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:02,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:02,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:02,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:02,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:42:02,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:02,860 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:02,860 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:02,889 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:02,890 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:02,982 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:02,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:03,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:03,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2019-02-28 10:42:03,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:03,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:42:03,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:42:03,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-28 10:42:03,408 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-02-28 10:42:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:03,706 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-28 10:42:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:42:03,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-02-28 10:42:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:03,708 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:42:03,708 INFO L226 Difference]: Without dead ends: 30 [2019-02-28 10:42:03,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2019-02-28 10:42:03,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-28 10:42:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-02-28 10:42:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-28 10:42:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-28 10:42:03,714 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2019-02-28 10:42:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:03,714 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-28 10:42:03,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:42:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-28 10:42:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-28 10:42:03,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:03,715 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2019-02-28 10:42:03,716 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2019-02-28 10:42:03,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:03,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:03,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:03,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:03,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:03,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:03,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:03,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:03,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:03,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:03,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:03,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:03,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:03,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:42:03,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:03,887 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:03,888 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:03,896 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:03,897 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:03,982 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:03,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:04,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:04,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2019-02-28 10:42:04,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:04,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:42:04,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:42:04,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:42:04,096 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-02-28 10:42:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:04,301 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-28 10:42:04,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:42:04,301 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-02-28 10:42:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:04,302 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:42:04,302 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:42:04,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=371, Unknown=0, NotChecked=0, Total=600 [2019-02-28 10:42:04,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:42:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-02-28 10:42:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:42:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-28 10:42:04,309 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2019-02-28 10:42:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:04,310 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-28 10:42:04,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:42:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-28 10:42:04,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-28 10:42:04,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:04,311 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2019-02-28 10:42:04,311 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:04,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:04,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2019-02-28 10:42:04,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:04,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:04,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:04,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:04,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:04,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:04,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:04,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:04,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:04,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:04,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:04,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:04,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-28 10:42:04,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:04,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:42:04,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:04,515 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:04,516 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:04,523 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:04,523 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:04,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:04,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:04,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2019-02-28 10:42:04,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:04,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:42:04,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:42:04,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2019-02-28 10:42:04,822 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2019-02-28 10:42:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:05,287 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-28 10:42:05,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:42:05,287 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-02-28 10:42:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:05,288 INFO L225 Difference]: With dead ends: 41 [2019-02-28 10:42:05,289 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:42:05,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=500, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:42:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:42:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-02-28 10:42:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:42:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-28 10:42:05,300 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2019-02-28 10:42:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:05,301 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-28 10:42:05,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:42:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-28 10:42:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:42:05,302 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:05,302 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2019-02-28 10:42:05,304 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2019-02-28 10:42:05,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:05,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:05,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:05,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:05,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:05,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:05,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:05,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:05,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:05,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:05,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:05,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:05,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:05,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:05,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:05,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:42:05,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:05,561 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:05,562 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:05,571 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:05,571 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:05,707 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:05,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:05,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2019-02-28 10:42:05,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:05,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:42:05,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:42:05,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:42:05,887 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2019-02-28 10:42:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:06,188 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-28 10:42:06,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:42:06,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-02-28 10:42:06,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:06,191 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:42:06,191 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:42:06,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-02-28 10:42:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:42:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-02-28 10:42:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-28 10:42:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-28 10:42:06,199 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2019-02-28 10:42:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:06,200 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-28 10:42:06,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:42:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-28 10:42:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-28 10:42:06,201 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:06,201 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2019-02-28 10:42:06,202 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:06,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:06,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2019-02-28 10:42:06,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:06,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:06,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:06,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:06,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:06,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:06,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:06,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:06,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:06,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:06,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:06,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:06,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:06,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:06,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:42:06,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:06,412 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:06,412 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:06,439 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:06,440 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:06,636 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:06,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:06,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2019-02-28 10:42:06,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:06,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:42:06,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:42:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2019-02-28 10:42:06,827 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2019-02-28 10:42:07,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:07,100 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-28 10:42:07,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:42:07,100 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-02-28 10:42:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:07,102 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:42:07,102 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:42:07,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=517, Invalid=815, Unknown=0, NotChecked=0, Total=1332 [2019-02-28 10:42:07,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:42:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-02-28 10:42:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:42:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-28 10:42:07,111 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2019-02-28 10:42:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:07,111 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-28 10:42:07,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:42:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-28 10:42:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-28 10:42:07,113 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:07,113 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2019-02-28 10:42:07,113 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2019-02-28 10:42:07,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:07,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:07,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:07,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:07,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:07,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:07,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:07,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:07,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:07,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:07,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:07,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:07,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:07,963 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-28 10:42:07,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:07,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:42:07,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:07,971 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:07,972 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:07,981 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:07,981 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:08,125 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:08,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:08,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:08,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2019-02-28 10:42:08,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:08,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:42:08,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:42:08,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=605, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:42:08,336 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2019-02-28 10:42:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:08,862 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-28 10:42:08,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:42:08,862 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-02-28 10:42:08,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:08,864 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:42:08,864 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:42:08,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=639, Invalid=1001, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:42:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:42:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-02-28 10:42:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:42:08,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-28 10:42:08,871 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2019-02-28 10:42:08,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:08,872 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-28 10:42:08,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:42:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-28 10:42:08,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:42:08,873 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:08,873 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2019-02-28 10:42:08,873 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:08,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:08,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2019-02-28 10:42:08,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:08,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:08,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:09,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:09,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:09,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:09,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:09,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:09,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:09,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:09,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:09,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:09,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:09,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:42:09,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:09,141 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:09,142 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:09,152 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:09,153 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:09,356 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:09,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:09,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:09,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2019-02-28 10:42:09,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:09,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:42:09,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:42:09,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=721, Unknown=0, NotChecked=0, Total=1190 [2019-02-28 10:42:09,588 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2019-02-28 10:42:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:10,078 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-28 10:42:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:42:10,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2019-02-28 10:42:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:10,079 INFO L225 Difference]: With dead ends: 61 [2019-02-28 10:42:10,079 INFO L226 Difference]: Without dead ends: 60 [2019-02-28 10:42:10,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=774, Invalid=1206, Unknown=0, NotChecked=0, Total=1980 [2019-02-28 10:42:10,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-28 10:42:10,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-02-28 10:42:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:42:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-28 10:42:10,090 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2019-02-28 10:42:10,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:10,090 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-28 10:42:10,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:42:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-28 10:42:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:42:10,091 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:10,091 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2019-02-28 10:42:10,092 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:10,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:10,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2019-02-28 10:42:10,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:10,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:10,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:10,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:10,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:10,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:10,315 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:10,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:10,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:10,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:10,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:10,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:10,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:42:10,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:10,373 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:10,374 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:10,382 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:10,383 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:10,609 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:10,610 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:10,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:10,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2019-02-28 10:42:10,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:10,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:42:10,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:42:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=847, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:42:10,960 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-02-28 10:42:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:11,301 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-28 10:42:11,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:42:11,301 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-02-28 10:42:11,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:11,302 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:42:11,302 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:42:11,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2019-02-28 10:42:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:42:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-02-28 10:42:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-28 10:42:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-28 10:42:11,314 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2019-02-28 10:42:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:11,314 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-28 10:42:11,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:42:11,314 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-28 10:42:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-28 10:42:11,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:11,315 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2019-02-28 10:42:11,316 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:11,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:11,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2019-02-28 10:42:11,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:11,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:11,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:11,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:11,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:11,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:11,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:11,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:11,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:11,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:11,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:11,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:11,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-28 10:42:11,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:11,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:42:11,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:11,944 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:11,945 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:11,953 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:11,954 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:12,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:12,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:12,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2019-02-28 10:42:12,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:12,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:42:12,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:42:12,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=983, Unknown=0, NotChecked=0, Total=1640 [2019-02-28 10:42:12,443 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2019-02-28 10:42:13,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:13,118 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-28 10:42:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:42:13,119 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-02-28 10:42:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:13,119 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:42:13,119 INFO L226 Difference]: Without dead ends: 70 [2019-02-28 10:42:13,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1083, Invalid=1673, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:42:13,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-28 10:42:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-02-28 10:42:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:42:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-28 10:42:13,131 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2019-02-28 10:42:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:13,131 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-28 10:42:13,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:42:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-28 10:42:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-28 10:42:13,133 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:13,133 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2019-02-28 10:42:13,133 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:13,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2019-02-28 10:42:13,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:13,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:13,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:13,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:13,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:13,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:13,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:13,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:13,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:13,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:13,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:13,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:13,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:13,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:13,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:42:13,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:13,598 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:13,598 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:13,631 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:13,632 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:14,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:15,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:15,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2019-02-28 10:42:15,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:15,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:42:15,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:42:15,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=1129, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:42:15,099 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2019-02-28 10:42:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:15,530 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-28 10:42:15,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:42:15,530 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-02-28 10:42:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:15,531 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:42:15,531 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:42:15,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1257, Invalid=1935, Unknown=0, NotChecked=0, Total=3192 [2019-02-28 10:42:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:42:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-02-28 10:42:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:42:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-28 10:42:15,545 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2019-02-28 10:42:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:15,546 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-28 10:42:15,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:42:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-28 10:42:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-28 10:42:15,547 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:15,547 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2019-02-28 10:42:15,547 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:15,548 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2019-02-28 10:42:15,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:15,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:15,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:15,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:15,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:15,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:15,937 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:15,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:15,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:15,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:15,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:15,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:15,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:15,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:15,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:15,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-28 10:42:15,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:15,999 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:16,000 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:16,008 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:16,008 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:16,244 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:16,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:16,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2019-02-28 10:42:16,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:16,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:42:16,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:42:16,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-02-28 10:42:16,584 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2019-02-28 10:42:17,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:17,137 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-28 10:42:17,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:42:17,137 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-02-28 10:42:17,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:17,138 INFO L225 Difference]: With dead ends: 81 [2019-02-28 10:42:17,138 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:42:17,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1444, Invalid=2216, Unknown=0, NotChecked=0, Total=3660 [2019-02-28 10:42:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:42:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-02-28 10:42:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:42:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-28 10:42:17,149 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2019-02-28 10:42:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:17,149 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-28 10:42:17,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:42:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-28 10:42:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:42:17,150 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:17,151 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2019-02-28 10:42:17,151 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:17,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:17,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2019-02-28 10:42:17,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:17,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:17,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:17,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:17,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:17,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:17,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:17,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:17,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:17,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:17,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:17,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:18,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-28 10:42:18,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:18,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:42:18,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:18,080 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:18,080 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:18,088 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:18,088 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:18,631 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:18,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:19,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:19,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2019-02-28 10:42:19,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:19,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:42:19,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:42:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=1451, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:42:19,346 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2019-02-28 10:42:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:19,856 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-28 10:42:19,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:42:19,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2019-02-28 10:42:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:19,858 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:42:19,858 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:42:19,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1644, Invalid=2516, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:42:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:42:19,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-02-28 10:42:19,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-28 10:42:19,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-28 10:42:19,872 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2019-02-28 10:42:19,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:19,872 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-28 10:42:19,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:42:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-28 10:42:19,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-28 10:42:19,873 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:19,873 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2019-02-28 10:42:19,873 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:19,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:19,874 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2019-02-28 10:42:19,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:19,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:19,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:19,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:19,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:20,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:20,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:20,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:20,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:20,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:20,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:20,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:20,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:20,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:20,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:42:20,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:20,517 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:20,517 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:20,528 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:20,528 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:20,782 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2019-02-28 10:42:21,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:21,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:42:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:42:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1129, Invalid=1627, Unknown=0, NotChecked=0, Total=2756 [2019-02-28 10:42:21,284 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2019-02-28 10:42:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:21,837 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-28 10:42:21,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:42:21,838 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2019-02-28 10:42:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:21,839 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:42:21,839 INFO L226 Difference]: Without dead ends: 90 [2019-02-28 10:42:21,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1857, Invalid=2835, Unknown=0, NotChecked=0, Total=4692 [2019-02-28 10:42:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-28 10:42:21,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-02-28 10:42:21,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:42:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-28 10:42:21,853 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2019-02-28 10:42:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:21,853 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-28 10:42:21,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:42:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-28 10:42:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:42:21,854 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:21,854 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2019-02-28 10:42:21,854 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:21,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2019-02-28 10:42:21,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:21,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:21,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:21,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:21,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:22,156 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:22,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:22,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:22,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:22,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:22,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:22,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:22,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:22,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:22,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:42:22,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:22,235 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:22,236 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:22,246 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:22,246 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:22,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:23,093 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:23,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:23,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2019-02-28 10:42:23,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:23,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:42:23,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:42:23,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=1813, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:42:23,114 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2019-02-28 10:42:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:23,735 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-28 10:42:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:42:23,735 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2019-02-28 10:42:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:23,736 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:42:23,736 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:42:23,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2083, Invalid=3173, Unknown=0, NotChecked=0, Total=5256 [2019-02-28 10:42:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:42:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-02-28 10:42:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-28 10:42:23,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-28 10:42:23,748 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2019-02-28 10:42:23,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:23,748 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-28 10:42:23,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:42:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-28 10:42:23,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-28 10:42:23,749 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:23,749 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2019-02-28 10:42:23,749 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:23,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:23,749 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2019-02-28 10:42:23,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:23,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:23,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:23,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:23,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:24,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:24,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:24,075 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:24,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:24,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:24,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:24,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:24,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:24,172 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-28 10:42:24,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:24,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:42:24,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:24,179 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:24,179 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:24,188 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:24,188 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:24,635 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:25,298 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:25,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:25,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2019-02-28 10:42:25,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:25,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:42:25,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:42:25,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=2009, Unknown=0, NotChecked=0, Total=3422 [2019-02-28 10:42:25,319 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2019-02-28 10:42:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:25,933 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-28 10:42:25,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:42:25,933 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2019-02-28 10:42:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:25,934 INFO L225 Difference]: With dead ends: 101 [2019-02-28 10:42:25,934 INFO L226 Difference]: Without dead ends: 100 [2019-02-28 10:42:25,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2322, Invalid=3530, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:42:25,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-28 10:42:25,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-02-28 10:42:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:42:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-28 10:42:25,946 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2019-02-28 10:42:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:25,946 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-28 10:42:25,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:42:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-28 10:42:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:42:25,947 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:25,947 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2019-02-28 10:42:25,948 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:25,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2019-02-28 10:42:25,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:25,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:25,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:26,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:26,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:26,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:26,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:26,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:26,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:26,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:26,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:26,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:26,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:26,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:42:26,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:26,496 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:26,496 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:26,504 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:26,504 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:26,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:27,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:27,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2019-02-28 10:42:27,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:27,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:42:27,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:42:27,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=2215, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:42:27,457 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2019-02-28 10:42:28,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:28,133 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-28 10:42:28,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:42:28,133 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-02-28 10:42:28,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:28,134 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:42:28,134 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:42:28,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2574, Invalid=3906, Unknown=0, NotChecked=0, Total=6480 [2019-02-28 10:42:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:42:28,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-02-28 10:42:28,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-28 10:42:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-28 10:42:28,146 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2019-02-28 10:42:28,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:28,146 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-28 10:42:28,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:42:28,146 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-28 10:42:28,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-28 10:42:28,147 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:28,147 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2019-02-28 10:42:28,147 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:28,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2019-02-28 10:42:28,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:28,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:28,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:28,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:29,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:29,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:29,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:29,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:29,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:29,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:29,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:29,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:29,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:42:29,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:29,820 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:29,821 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:29,832 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:29,833 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:30,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:30,846 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:30,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:30,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2019-02-28 10:42:30,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:30,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:42:30,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:42:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1729, Invalid=2431, Unknown=0, NotChecked=0, Total=4160 [2019-02-28 10:42:30,867 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2019-02-28 10:42:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:31,656 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-28 10:42:31,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:42:31,659 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2019-02-28 10:42:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:31,660 INFO L225 Difference]: With dead ends: 111 [2019-02-28 10:42:31,660 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:42:31,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2839, Invalid=4301, Unknown=0, NotChecked=0, Total=7140 [2019-02-28 10:42:31,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:42:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-02-28 10:42:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-28 10:42:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-28 10:42:31,673 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2019-02-28 10:42:31,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:31,673 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-28 10:42:31,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:42:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-28 10:42:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-28 10:42:31,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:31,673 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2019-02-28 10:42:31,674 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2019-02-28 10:42:31,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:31,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:31,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:31,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:32,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:32,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:32,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:32,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:32,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:32,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:32,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:32,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:32,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-28 10:42:32,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:32,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:42:32,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:32,207 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:32,208 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:32,216 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:32,216 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:32,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:32,627 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:33,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:33,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:33,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2019-02-28 10:42:33,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:33,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:42:33,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:42:33,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1899, Invalid=2657, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:42:33,468 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2019-02-28 10:42:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:34,456 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-28 10:42:34,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:42:34,457 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2019-02-28 10:42:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:34,458 INFO L225 Difference]: With dead ends: 116 [2019-02-28 10:42:34,458 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:42:34,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3117, Invalid=4715, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:42:34,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:42:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-02-28 10:42:34,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:42:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-28 10:42:34,472 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2019-02-28 10:42:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:34,472 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-28 10:42:34,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:42:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-28 10:42:34,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:42:34,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:34,473 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2019-02-28 10:42:34,473 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:34,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:34,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2019-02-28 10:42:34,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:34,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:34,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:34,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:34,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:34,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:34,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:34,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:34,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:34,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:34,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:34,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:35,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:35,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:35,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:42:35,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:35,048 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:35,049 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:35,142 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:35,142 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:35,798 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:36,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:36,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2019-02-28 10:42:36,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:36,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:42:36,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:42:36,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=2893, Unknown=0, NotChecked=0, Total=4970 [2019-02-28 10:42:36,520 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2019-02-28 10:42:37,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:37,399 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-02-28 10:42:37,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:42:37,399 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2019-02-28 10:42:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:37,400 INFO L225 Difference]: With dead ends: 121 [2019-02-28 10:42:37,401 INFO L226 Difference]: Without dead ends: 120 [2019-02-28 10:42:37,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3408, Invalid=5148, Unknown=0, NotChecked=0, Total=8556 [2019-02-28 10:42:37,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-02-28 10:42:37,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-02-28 10:42:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-28 10:42:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-02-28 10:42:37,419 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2019-02-28 10:42:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:37,419 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-02-28 10:42:37,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:42:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-02-28 10:42:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-02-28 10:42:37,420 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:37,420 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2019-02-28 10:42:37,421 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:37,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:37,421 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2019-02-28 10:42:37,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:37,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:37,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:38,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:38,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:38,365 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:38,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:38,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:38,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:38,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:38,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:38,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:42:38,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:38,472 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:38,473 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:38,486 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:38,487 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:38,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:40,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:40,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2019-02-28 10:42:40,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:40,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:42:40,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:42:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2263, Invalid=3139, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:42:40,034 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2019-02-28 10:42:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:41,087 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-28 10:42:41,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:42:41,088 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2019-02-28 10:42:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:41,089 INFO L225 Difference]: With dead ends: 126 [2019-02-28 10:42:41,089 INFO L226 Difference]: Without dead ends: 125 [2019-02-28 10:42:41,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3712, Invalid=5600, Unknown=0, NotChecked=0, Total=9312 [2019-02-28 10:42:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-28 10:42:41,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-02-28 10:42:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-28 10:42:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-02-28 10:42:41,103 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2019-02-28 10:42:41,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:41,103 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-02-28 10:42:41,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:42:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-02-28 10:42:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-28 10:42:41,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:41,104 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2019-02-28 10:42:41,104 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:41,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:41,104 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2019-02-28 10:42:41,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:41,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:41,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:42,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:42,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:42,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:42,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:42,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:42,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:42,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:42,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:42,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-28 10:42:42,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:42,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:42:42,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:42,616 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:42,616 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:42,627 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:42,627 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:43,112 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:44,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:44,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 76 [2019-02-28 10:42:44,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:44,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:42:44,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:42:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2457, Invalid=3395, Unknown=0, NotChecked=0, Total=5852 [2019-02-28 10:42:44,060 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2019-02-28 10:42:45,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:45,150 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-02-28 10:42:45,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:42:45,151 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2019-02-28 10:42:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:45,152 INFO L225 Difference]: With dead ends: 131 [2019-02-28 10:42:45,152 INFO L226 Difference]: Without dead ends: 130 [2019-02-28 10:42:45,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4029, Invalid=6071, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:42:45,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-28 10:42:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-02-28 10:42:45,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-28 10:42:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-02-28 10:42:45,167 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2019-02-28 10:42:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:45,168 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-02-28 10:42:45,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:42:45,168 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-02-28 10:42:45,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-28 10:42:45,168 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:45,168 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2019-02-28 10:42:45,169 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:45,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:45,169 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2019-02-28 10:42:45,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:45,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:45,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:45,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:45,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:45,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:45,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:45,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:45,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:45,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:45,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:45,759 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:45,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:45,841 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:45,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:45,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:42:45,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:45,863 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:45,864 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:45,951 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:45,951 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:46,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:47,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:47,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2019-02-28 10:42:47,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:47,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:42:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:42:47,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2659, Invalid=3661, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:42:47,563 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2019-02-28 10:42:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:48,620 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-02-28 10:42:48,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:42:48,621 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2019-02-28 10:42:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:48,622 INFO L225 Difference]: With dead ends: 136 [2019-02-28 10:42:48,622 INFO L226 Difference]: Without dead ends: 135 [2019-02-28 10:42:48,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4359, Invalid=6561, Unknown=0, NotChecked=0, Total=10920 [2019-02-28 10:42:48,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-28 10:42:48,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-02-28 10:42:48,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-28 10:42:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-02-28 10:42:48,643 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2019-02-28 10:42:48,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:48,644 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-02-28 10:42:48,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:42:48,644 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-02-28 10:42:48,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-02-28 10:42:48,644 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:48,644 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2019-02-28 10:42:48,645 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:48,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2019-02-28 10:42:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:48,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:48,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:48,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:48,646 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:49,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:49,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:49,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:49,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:49,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:49,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:49,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:49,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:42:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:49,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-28 10:42:49,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:49,390 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:49,391 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:49,424 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:49,424 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:50,152 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:51,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:51,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 82 [2019-02-28 10:42:51,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:51,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:42:51,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:42:51,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2869, Invalid=3937, Unknown=0, NotChecked=0, Total=6806 [2019-02-28 10:42:51,263 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2019-02-28 10:42:52,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:52,279 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-02-28 10:42:52,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:42:52,281 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2019-02-28 10:42:52,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:52,282 INFO L225 Difference]: With dead ends: 141 [2019-02-28 10:42:52,282 INFO L226 Difference]: Without dead ends: 140 [2019-02-28 10:42:52,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4702, Invalid=7070, Unknown=0, NotChecked=0, Total=11772 [2019-02-28 10:42:52,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-02-28 10:42:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-02-28 10:42:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-02-28 10:42:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-02-28 10:42:52,306 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2019-02-28 10:42:52,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:52,307 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-02-28 10:42:52,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:42:52,307 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-02-28 10:42:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-02-28 10:42:52,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:52,308 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2019-02-28 10:42:52,308 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:52,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:52,308 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2019-02-28 10:42:52,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:52,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:52,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:42:52,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:52,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:52,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:52,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:52,874 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:52,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:52,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:52,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:52,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:42:52,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:42:53,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-28 10:42:53,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:53,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:42:53,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:53,061 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:53,061 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:53,149 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:53,150 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:54,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:42:55,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:55,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:42:55,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2019-02-28 10:42:55,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:42:55,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:42:55,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:42:55,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3087, Invalid=4223, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:42:55,640 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2019-02-28 10:42:56,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:42:56,883 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-02-28 10:42:56,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:42:56,884 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-02-28 10:42:56,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:42:56,885 INFO L225 Difference]: With dead ends: 146 [2019-02-28 10:42:56,885 INFO L226 Difference]: Without dead ends: 145 [2019-02-28 10:42:56,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5058, Invalid=7598, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:42:56,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-28 10:42:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-02-28 10:42:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-02-28 10:42:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-02-28 10:42:56,903 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2019-02-28 10:42:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:42:56,904 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-02-28 10:42:56,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:42:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-02-28 10:42:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-02-28 10:42:56,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:42:56,904 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2019-02-28 10:42:56,904 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:42:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:42:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2019-02-28 10:42:56,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:42:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:56,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:42:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:42:56,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:42:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:42:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:58,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:58,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:42:58,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:42:58,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:42:58,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:42:58,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:42:58,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:42:58,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:42:58,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:42:58,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:42:58,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:42:58,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:42:58,784 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:42:58,784 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:42:58,795 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:42:58,795 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:42:59,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:42:59,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:00,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:00,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 88 [2019-02-28 10:43:00,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:00,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:43:00,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:43:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3313, Invalid=4519, Unknown=0, NotChecked=0, Total=7832 [2019-02-28 10:43:00,974 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2019-02-28 10:43:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:02,136 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-02-28 10:43:02,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:43:02,136 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2019-02-28 10:43:02,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:02,137 INFO L225 Difference]: With dead ends: 151 [2019-02-28 10:43:02,137 INFO L226 Difference]: Without dead ends: 150 [2019-02-28 10:43:02,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4056 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5427, Invalid=8145, Unknown=0, NotChecked=0, Total=13572 [2019-02-28 10:43:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-02-28 10:43:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-02-28 10:43:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-28 10:43:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-02-28 10:43:02,157 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2019-02-28 10:43:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:02,157 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-02-28 10:43:02,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:43:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-02-28 10:43:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-28 10:43:02,158 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:02,158 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2019-02-28 10:43:02,158 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2019-02-28 10:43:02,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:02,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:02,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:02,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:02,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:02,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:02,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:02,980 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:02,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:02,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:02,980 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:02,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:02,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:03,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:43:03,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:03,092 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:03,092 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:03,105 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:03,106 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:03,773 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:05,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:05,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2019-02-28 10:43:05,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:05,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:43:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:43:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3547, Invalid=4825, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:43:05,304 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2019-02-28 10:43:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:06,627 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-02-28 10:43:06,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:43:06,627 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2019-02-28 10:43:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:06,628 INFO L225 Difference]: With dead ends: 156 [2019-02-28 10:43:06,628 INFO L226 Difference]: Without dead ends: 155 [2019-02-28 10:43:06,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5809, Invalid=8711, Unknown=0, NotChecked=0, Total=14520 [2019-02-28 10:43:06,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-28 10:43:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-02-28 10:43:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-02-28 10:43:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-02-28 10:43:06,648 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2019-02-28 10:43:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:06,648 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-02-28 10:43:06,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:43:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-02-28 10:43:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-02-28 10:43:06,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:06,649 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2019-02-28 10:43:06,649 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:06,650 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2019-02-28 10:43:06,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:06,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:06,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:06,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:06,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:07,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:07,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:07,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:07,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:07,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:07,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:07,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:07,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:07,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-28 10:43:07,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:07,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:43:07,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:07,686 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:07,686 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:07,699 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:07,699 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:08,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:08,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:10,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:10,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:10,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2019-02-28 10:43:10,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:10,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:43:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:43:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3789, Invalid=5141, Unknown=0, NotChecked=0, Total=8930 [2019-02-28 10:43:10,477 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2019-02-28 10:43:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:11,714 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-02-28 10:43:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:43:11,714 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2019-02-28 10:43:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:11,715 INFO L225 Difference]: With dead ends: 161 [2019-02-28 10:43:11,715 INFO L226 Difference]: Without dead ends: 160 [2019-02-28 10:43:11,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4646 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6204, Invalid=9296, Unknown=0, NotChecked=0, Total=15500 [2019-02-28 10:43:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-28 10:43:11,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-02-28 10:43:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-28 10:43:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-28 10:43:11,745 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2019-02-28 10:43:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:11,745 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-28 10:43:11,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:43:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-28 10:43:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-28 10:43:11,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:11,746 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2019-02-28 10:43:11,747 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:11,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:11,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2019-02-28 10:43:11,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:11,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:11,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:11,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:12,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:12,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:12,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:12,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:12,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:12,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:12,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:12,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:12,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:12,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:12,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:43:12,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:12,667 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:12,668 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:12,748 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:12,748 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:13,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:13,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:15,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:15,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 97 [2019-02-28 10:43:15,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:15,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:43:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:43:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4039, Invalid=5467, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:43:15,172 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2019-02-28 10:43:16,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:16,638 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-02-28 10:43:16,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:43:16,639 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2019-02-28 10:43:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:16,640 INFO L225 Difference]: With dead ends: 166 [2019-02-28 10:43:16,640 INFO L226 Difference]: Without dead ends: 165 [2019-02-28 10:43:16,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6612, Invalid=9900, Unknown=0, NotChecked=0, Total=16512 [2019-02-28 10:43:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-02-28 10:43:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-02-28 10:43:16,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-02-28 10:43:16,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-02-28 10:43:16,673 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2019-02-28 10:43:16,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:16,673 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-02-28 10:43:16,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:43:16,674 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-02-28 10:43:16,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-02-28 10:43:16,674 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:16,675 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2019-02-28 10:43:16,675 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:16,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:16,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2019-02-28 10:43:16,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:16,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:16,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:16,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:16,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:17,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:17,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:17,468 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:17,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:17,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:17,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:17,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:17,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:17,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:43:17,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:17,612 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:17,612 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:17,622 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:17,622 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:18,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:19,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:19,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:19,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 100 [2019-02-28 10:43:19,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:19,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:43:19,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:43:19,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4297, Invalid=5803, Unknown=0, NotChecked=0, Total=10100 [2019-02-28 10:43:19,947 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2019-02-28 10:43:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:21,604 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-28 10:43:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:43:21,604 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2019-02-28 10:43:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:21,605 INFO L225 Difference]: With dead ends: 171 [2019-02-28 10:43:21,605 INFO L226 Difference]: Without dead ends: 170 [2019-02-28 10:43:21,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5276 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7033, Invalid=10523, Unknown=0, NotChecked=0, Total=17556 [2019-02-28 10:43:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-28 10:43:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-02-28 10:43:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-02-28 10:43:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-02-28 10:43:21,634 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2019-02-28 10:43:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:21,634 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-02-28 10:43:21,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:43:21,635 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-02-28 10:43:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-02-28 10:43:21,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:21,635 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2019-02-28 10:43:21,635 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:21,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2019-02-28 10:43:21,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:21,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:21,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:21,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:22,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:22,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:22,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:22,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:22,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:22,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:22,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:22,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:22,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:22,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-28 10:43:22,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:22,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-28 10:43:22,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:22,718 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:22,718 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:22,729 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:22,729 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:23,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:25,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:25,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 103 [2019-02-28 10:43:25,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:25,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:43:25,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:43:25,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=6149, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:43:25,187 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2019-02-28 10:43:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:26,936 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-02-28 10:43:26,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:43:26,936 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-02-28 10:43:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:26,937 INFO L225 Difference]: With dead ends: 176 [2019-02-28 10:43:26,938 INFO L226 Difference]: Without dead ends: 175 [2019-02-28 10:43:26,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5606 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7467, Invalid=11165, Unknown=0, NotChecked=0, Total=18632 [2019-02-28 10:43:26,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-02-28 10:43:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-02-28 10:43:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-02-28 10:43:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-02-28 10:43:26,972 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2019-02-28 10:43:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:26,973 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-02-28 10:43:26,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:43:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-02-28 10:43:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-02-28 10:43:26,974 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:26,974 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2019-02-28 10:43:26,974 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:26,975 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2019-02-28 10:43:26,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:26,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:26,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:26,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:28,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:28,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:28,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:28,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:28,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:28,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:28,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:28,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:28,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:28,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:28,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-28 10:43:28,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:28,548 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:28,548 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:28,557 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:28,557 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:29,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:31,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:31,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 106 [2019-02-28 10:43:31,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:31,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:43:31,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:43:31,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4837, Invalid=6505, Unknown=0, NotChecked=0, Total=11342 [2019-02-28 10:43:31,387 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2019-02-28 10:43:32,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:32,993 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-02-28 10:43:32,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:43:32,994 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2019-02-28 10:43:32,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:32,995 INFO L225 Difference]: With dead ends: 181 [2019-02-28 10:43:32,995 INFO L226 Difference]: Without dead ends: 180 [2019-02-28 10:43:32,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5946 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7914, Invalid=11826, Unknown=0, NotChecked=0, Total=19740 [2019-02-28 10:43:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-28 10:43:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-02-28 10:43:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-02-28 10:43:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-02-28 10:43:33,030 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2019-02-28 10:43:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:33,030 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-02-28 10:43:33,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:43:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-02-28 10:43:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-02-28 10:43:33,031 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:33,032 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2019-02-28 10:43:33,032 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:33,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2019-02-28 10:43:33,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:33,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:33,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:33,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:33,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:33,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:33,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:33,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:33,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:33,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:33,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:33,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:34,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 119 conjunts are in the unsatisfiable core [2019-02-28 10:43:34,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:34,053 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:34,053 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:34,129 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:34,130 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:35,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:37,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:37,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2019-02-28 10:43:37,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:37,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:43:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:43:37,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5119, Invalid=6871, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:43:37,211 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2019-02-28 10:43:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:38,884 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-02-28 10:43:38,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:43:38,884 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2019-02-28 10:43:38,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:38,886 INFO L225 Difference]: With dead ends: 186 [2019-02-28 10:43:38,886 INFO L226 Difference]: Without dead ends: 185 [2019-02-28 10:43:38,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6296 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8374, Invalid=12506, Unknown=0, NotChecked=0, Total=20880 [2019-02-28 10:43:38,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-28 10:43:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-02-28 10:43:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-28 10:43:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-02-28 10:43:38,925 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2019-02-28 10:43:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:38,925 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-02-28 10:43:38,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:43:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-02-28 10:43:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-28 10:43:38,926 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:38,926 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2019-02-28 10:43:38,927 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:38,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:38,927 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2019-02-28 10:43:38,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:38,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:38,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:40,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:40,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:40,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:40,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:40,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:40,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:40,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:40,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:43:40,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:43:40,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-28 10:43:40,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:40,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 124 conjunts are in the unsatisfiable core [2019-02-28 10:43:40,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:40,401 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:40,402 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:40,483 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:40,483 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:41,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:43,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:43,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 112 [2019-02-28 10:43:43,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:43,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:43:43,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:43:43,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5409, Invalid=7247, Unknown=0, NotChecked=0, Total=12656 [2019-02-28 10:43:43,651 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2019-02-28 10:43:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:45,261 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-02-28 10:43:45,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:43:45,262 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2019-02-28 10:43:45,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:45,263 INFO L225 Difference]: With dead ends: 191 [2019-02-28 10:43:45,263 INFO L226 Difference]: Without dead ends: 190 [2019-02-28 10:43:45,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8847, Invalid=13205, Unknown=0, NotChecked=0, Total=22052 [2019-02-28 10:43:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-28 10:43:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-02-28 10:43:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-28 10:43:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-02-28 10:43:45,297 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2019-02-28 10:43:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:45,297 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-02-28 10:43:45,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:43:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-02-28 10:43:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-28 10:43:45,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:45,298 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2019-02-28 10:43:45,299 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2019-02-28 10:43:45,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:45,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:45,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:46,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:46,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:46,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:46,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:46,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:46,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:43:46,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:43:46,626 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:43:46,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:43:46,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-28 10:43:46,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:46,649 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:46,650 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:46,701 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:46,701 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:48,268 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:50,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:50,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 115 [2019-02-28 10:43:50,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:50,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:43:50,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:43:50,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5707, Invalid=7633, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:43:50,329 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2019-02-28 10:43:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:52,266 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-02-28 10:43:52,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:43:52,266 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2019-02-28 10:43:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:52,267 INFO L225 Difference]: With dead ends: 196 [2019-02-28 10:43:52,267 INFO L226 Difference]: Without dead ends: 195 [2019-02-28 10:43:52,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9333, Invalid=13923, Unknown=0, NotChecked=0, Total=23256 [2019-02-28 10:43:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-02-28 10:43:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-02-28 10:43:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-28 10:43:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-02-28 10:43:52,299 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2019-02-28 10:43:52,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:52,299 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-02-28 10:43:52,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:43:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-02-28 10:43:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-28 10:43:52,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:52,300 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2019-02-28 10:43:52,300 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2019-02-28 10:43:52,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:52,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:52,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:43:52,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:52,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:53,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:53,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:43:53,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:43:53,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:43:53,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:43:53,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:43:53,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:53,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:43:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:43:53,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 128 conjunts are in the unsatisfiable core [2019-02-28 10:43:53,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:43:53,437 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:43:53,437 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:43:53,450 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:43:53,450 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:43:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:54,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:43:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:43:56,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:43:56,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 118 [2019-02-28 10:43:56,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:43:56,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:43:56,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:43:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6013, Invalid=8029, Unknown=0, NotChecked=0, Total=14042 [2019-02-28 10:43:56,744 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2019-02-28 10:43:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:43:58,496 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-02-28 10:43:58,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:43:58,496 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2019-02-28 10:43:58,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:43:58,497 INFO L225 Difference]: With dead ends: 201 [2019-02-28 10:43:58,497 INFO L226 Difference]: Without dead ends: 200 [2019-02-28 10:43:58,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9832, Invalid=14660, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:43:58,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-02-28 10:43:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-02-28 10:43:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-02-28 10:43:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-02-28 10:43:58,531 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2019-02-28 10:43:58,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:43:58,531 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-02-28 10:43:58,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:43:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-02-28 10:43:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-02-28 10:43:58,532 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:43:58,532 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2019-02-28 10:43:58,532 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:43:58,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:43:58,533 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2019-02-28 10:43:58,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:43:58,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:58,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:43:58,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:43:58,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:43:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:00,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:00,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:00,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:00,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:00,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:00,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:00,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:00,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:00,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-28 10:44:00,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:00,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-28 10:44:00,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:00,833 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:00,834 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:00,847 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:00,847 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:02,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:04,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:04,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 121 [2019-02-28 10:44:04,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:04,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:44:04,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:44:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6327, Invalid=8435, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:44:04,445 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2019-02-28 10:44:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:06,371 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-02-28 10:44:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:44:06,372 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2019-02-28 10:44:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:06,373 INFO L225 Difference]: With dead ends: 206 [2019-02-28 10:44:06,373 INFO L226 Difference]: Without dead ends: 205 [2019-02-28 10:44:06,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7796 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10344, Invalid=15416, Unknown=0, NotChecked=0, Total=25760 [2019-02-28 10:44:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-02-28 10:44:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-02-28 10:44:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-28 10:44:06,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-02-28 10:44:06,406 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2019-02-28 10:44:06,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:06,406 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-02-28 10:44:06,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:44:06,406 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-02-28 10:44:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-02-28 10:44:06,407 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:06,407 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2019-02-28 10:44:06,407 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:06,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2019-02-28 10:44:06,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:06,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:06,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:07,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:07,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:07,640 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:07,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:07,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:07,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:07,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:07,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:07,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:07,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:07,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 136 conjunts are in the unsatisfiable core [2019-02-28 10:44:07,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:07,785 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:07,785 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:07,795 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:07,795 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:08,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:08,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:11,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:11,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:11,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 124 [2019-02-28 10:44:11,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:11,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:44:11,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:44:11,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6649, Invalid=8851, Unknown=0, NotChecked=0, Total=15500 [2019-02-28 10:44:11,285 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2019-02-28 10:44:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:13,429 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-02-28 10:44:13,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:44:13,429 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2019-02-28 10:44:13,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:13,430 INFO L225 Difference]: With dead ends: 211 [2019-02-28 10:44:13,430 INFO L226 Difference]: Without dead ends: 210 [2019-02-28 10:44:13,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8196 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10869, Invalid=16191, Unknown=0, NotChecked=0, Total=27060 [2019-02-28 10:44:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-02-28 10:44:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2019-02-28 10:44:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-02-28 10:44:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-02-28 10:44:13,471 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2019-02-28 10:44:13,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:13,471 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-02-28 10:44:13,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:44:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-02-28 10:44:13,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-02-28 10:44:13,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:13,472 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2019-02-28 10:44:13,473 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:13,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2019-02-28 10:44:13,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:13,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:13,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:14,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:14,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:14,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:14,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:14,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:14,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:14,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:14,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:14,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 879 conjuncts, 137 conjunts are in the unsatisfiable core [2019-02-28 10:44:14,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:14,759 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:14,760 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:14,849 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:14,850 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:16,080 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:18,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:18,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 127 [2019-02-28 10:44:18,715 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:18,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:44:18,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:44:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6979, Invalid=9277, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:44:18,716 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2019-02-28 10:44:20,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:20,727 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-02-28 10:44:20,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:44:20,728 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2019-02-28 10:44:20,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:20,729 INFO L225 Difference]: With dead ends: 216 [2019-02-28 10:44:20,729 INFO L226 Difference]: Without dead ends: 215 [2019-02-28 10:44:20,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8606 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=11407, Invalid=16985, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:44:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-28 10:44:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-02-28 10:44:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-28 10:44:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-02-28 10:44:20,765 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2019-02-28 10:44:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:20,766 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-02-28 10:44:20,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:44:20,766 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-02-28 10:44:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-02-28 10:44:20,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:20,767 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2019-02-28 10:44:20,767 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:20,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:20,767 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2019-02-28 10:44:20,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:20,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:20,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:22,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:22,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:22,174 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:22,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:22,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:22,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:22,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:22,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:22,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-28 10:44:22,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:22,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 144 conjunts are in the unsatisfiable core [2019-02-28 10:44:22,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:22,485 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:22,486 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:22,489 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:22,490 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:23,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:26,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:26,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 130 [2019-02-28 10:44:26,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:26,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:44:26,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:44:26,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7317, Invalid=9713, Unknown=0, NotChecked=0, Total=17030 [2019-02-28 10:44:26,192 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2019-02-28 10:44:28,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:28,386 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-02-28 10:44:28,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:44:28,387 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2019-02-28 10:44:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:28,388 INFO L225 Difference]: With dead ends: 221 [2019-02-28 10:44:28,388 INFO L226 Difference]: Without dead ends: 220 [2019-02-28 10:44:28,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9026 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=11958, Invalid=17798, Unknown=0, NotChecked=0, Total=29756 [2019-02-28 10:44:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-02-28 10:44:28,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-02-28 10:44:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-28 10:44:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-28 10:44:28,423 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2019-02-28 10:44:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:28,423 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-28 10:44:28,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:44:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-28 10:44:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-28 10:44:28,424 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:28,424 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2019-02-28 10:44:28,424 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2019-02-28 10:44:28,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:28,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:28,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:28,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:29,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:29,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:29,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:29,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:29,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:29,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:29,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:29,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:29,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:29,779 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:29,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:29,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 145 conjunts are in the unsatisfiable core [2019-02-28 10:44:29,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:29,788 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:29,788 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:29,803 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:29,804 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:31,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:34,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:34,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 133 [2019-02-28 10:44:34,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:34,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:44:34,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:44:34,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7663, Invalid=10159, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:44:34,301 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2019-02-28 10:44:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:36,497 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-02-28 10:44:36,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:44:36,498 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2019-02-28 10:44:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:36,499 INFO L225 Difference]: With dead ends: 226 [2019-02-28 10:44:36,499 INFO L226 Difference]: Without dead ends: 225 [2019-02-28 10:44:36,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12522, Invalid=18630, Unknown=0, NotChecked=0, Total=31152 [2019-02-28 10:44:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-02-28 10:44:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-02-28 10:44:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-02-28 10:44:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-02-28 10:44:36,537 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2019-02-28 10:44:36,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:36,537 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-02-28 10:44:36,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:44:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-02-28 10:44:36,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-02-28 10:44:36,538 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:36,539 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2019-02-28 10:44:36,539 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2019-02-28 10:44:36,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:36,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:36,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:38,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:38,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:38,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:38,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:38,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:38,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:38,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:38,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:44:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:38,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 942 conjuncts, 146 conjunts are in the unsatisfiable core [2019-02-28 10:44:38,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:38,342 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:38,342 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:38,354 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:38,354 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:39,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:42,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:42,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 136 [2019-02-28 10:44:42,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:42,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:44:42,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:44:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8017, Invalid=10615, Unknown=0, NotChecked=0, Total=18632 [2019-02-28 10:44:42,665 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2019-02-28 10:44:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:45,049 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-28 10:44:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:44:45,049 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2019-02-28 10:44:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:45,051 INFO L225 Difference]: With dead ends: 231 [2019-02-28 10:44:45,051 INFO L226 Difference]: Without dead ends: 230 [2019-02-28 10:44:45,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9896 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13099, Invalid=19481, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:44:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-28 10:44:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-02-28 10:44:45,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-28 10:44:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-02-28 10:44:45,105 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2019-02-28 10:44:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:45,106 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-02-28 10:44:45,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:44:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-02-28 10:44:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-28 10:44:45,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:45,107 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2019-02-28 10:44:45,107 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:45,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2019-02-28 10:44:45,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:45,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:45,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:44:45,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:45,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:46,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:46,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:46,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:46,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:46,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:46,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:46,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:44:46,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:44:47,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-28 10:44:47,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:47,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 151 conjunts are in the unsatisfiable core [2019-02-28 10:44:47,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:47,129 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:47,129 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:47,139 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:47,139 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:48,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:48,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:44:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:51,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:44:51,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 139 [2019-02-28 10:44:51,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:44:51,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:44:51,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:44:51,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8379, Invalid=11081, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:44:51,662 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2019-02-28 10:44:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:44:54,207 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-02-28 10:44:54,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:44:54,207 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2019-02-28 10:44:54,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:44:54,209 INFO L225 Difference]: With dead ends: 236 [2019-02-28 10:44:54,209 INFO L226 Difference]: Without dead ends: 235 [2019-02-28 10:44:54,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10346 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13689, Invalid=20351, Unknown=0, NotChecked=0, Total=34040 [2019-02-28 10:44:54,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-02-28 10:44:54,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-02-28 10:44:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-02-28 10:44:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-02-28 10:44:54,265 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2019-02-28 10:44:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:44:54,266 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-02-28 10:44:54,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:44:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-02-28 10:44:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-02-28 10:44:54,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:44:54,267 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2019-02-28 10:44:54,268 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:44:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:44:54,268 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2019-02-28 10:44:54,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:44:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:54,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:44:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:44:54,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:44:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:44:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:55,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:55,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:44:55,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:44:55,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:44:55,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:44:55,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:44:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:44:55,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:44:55,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:44:55,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:44:55,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-28 10:44:55,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:44:55,814 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:44:55,815 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:44:55,825 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:44:55,825 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:44:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:44:57,282 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:00,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:00,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 142 [2019-02-28 10:45:00,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:00,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:45:00,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:45:00,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8749, Invalid=11557, Unknown=0, NotChecked=0, Total=20306 [2019-02-28 10:45:00,821 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2019-02-28 10:45:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:03,451 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-02-28 10:45:03,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:45:03,451 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2019-02-28 10:45:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:03,453 INFO L225 Difference]: With dead ends: 241 [2019-02-28 10:45:03,453 INFO L226 Difference]: Without dead ends: 240 [2019-02-28 10:45:03,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10806 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=14292, Invalid=21240, Unknown=0, NotChecked=0, Total=35532 [2019-02-28 10:45:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-28 10:45:03,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2019-02-28 10:45:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-02-28 10:45:03,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-02-28 10:45:03,520 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2019-02-28 10:45:03,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:03,520 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-02-28 10:45:03,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:45:03,520 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-02-28 10:45:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-02-28 10:45:03,522 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:03,522 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2019-02-28 10:45:03,522 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:03,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:03,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2019-02-28 10:45:03,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:03,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:03,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:03,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:04,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:04,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:04,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:04,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:04,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:04,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:04,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:04,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:05,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 155 conjunts are in the unsatisfiable core [2019-02-28 10:45:05,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:05,045 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:05,046 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:05,063 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:05,063 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:06,567 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:09,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:09,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 145 [2019-02-28 10:45:09,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:09,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:45:09,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:45:09,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9127, Invalid=12043, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:45:09,974 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2019-02-28 10:45:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:12,489 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-02-28 10:45:12,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:45:12,489 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2019-02-28 10:45:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:12,490 INFO L225 Difference]: With dead ends: 246 [2019-02-28 10:45:12,491 INFO L226 Difference]: Without dead ends: 245 [2019-02-28 10:45:12,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11276 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=14908, Invalid=22148, Unknown=0, NotChecked=0, Total=37056 [2019-02-28 10:45:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-02-28 10:45:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-02-28 10:45:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-02-28 10:45:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-02-28 10:45:12,534 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2019-02-28 10:45:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:12,534 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2019-02-28 10:45:12,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:45:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2019-02-28 10:45:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-02-28 10:45:12,535 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:12,535 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2019-02-28 10:45:12,535 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:12,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2019-02-28 10:45:12,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:12,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:12,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:12,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:14,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:14,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:14,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:14,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:14,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:14,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:14,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:14,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:14,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:14,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-28 10:45:14,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:14,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 160 conjunts are in the unsatisfiable core [2019-02-28 10:45:14,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:14,520 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:14,520 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:14,528 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:14,528 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:16,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:16,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:19,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:19,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 148 [2019-02-28 10:45:19,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:19,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:45:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:45:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9513, Invalid=12539, Unknown=0, NotChecked=0, Total=22052 [2019-02-28 10:45:19,549 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2019-02-28 10:45:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:22,046 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-02-28 10:45:22,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:45:22,046 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2019-02-28 10:45:22,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:22,047 INFO L225 Difference]: With dead ends: 251 [2019-02-28 10:45:22,047 INFO L226 Difference]: Without dead ends: 250 [2019-02-28 10:45:22,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11756 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=15537, Invalid=23075, Unknown=0, NotChecked=0, Total=38612 [2019-02-28 10:45:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-28 10:45:22,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2019-02-28 10:45:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-02-28 10:45:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-02-28 10:45:22,092 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2019-02-28 10:45:22,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:22,092 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-02-28 10:45:22,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:45:22,092 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-02-28 10:45:22,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-02-28 10:45:22,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:22,093 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2019-02-28 10:45:22,093 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:22,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:22,094 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2019-02-28 10:45:22,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:22,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:22,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:22,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:23,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:23,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:23,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:23,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:23,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:23,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:23,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:23,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:23,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:23,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:23,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 163 conjunts are in the unsatisfiable core [2019-02-28 10:45:23,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:23,790 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:23,790 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:23,802 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:23,802 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:25,407 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:25,407 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:28,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:28,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-28 10:45:28,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:28,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:45:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:45:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9907, Invalid=13045, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:45:28,987 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2019-02-28 10:45:31,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:31,620 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2019-02-28 10:45:31,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:45:31,620 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2019-02-28 10:45:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:31,622 INFO L225 Difference]: With dead ends: 256 [2019-02-28 10:45:31,623 INFO L226 Difference]: Without dead ends: 255 [2019-02-28 10:45:31,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12246 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=16179, Invalid=24021, Unknown=0, NotChecked=0, Total=40200 [2019-02-28 10:45:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-02-28 10:45:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-02-28 10:45:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-02-28 10:45:31,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-02-28 10:45:31,669 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2019-02-28 10:45:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:31,669 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-02-28 10:45:31,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:45:31,670 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-02-28 10:45:31,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-02-28 10:45:31,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:31,671 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2019-02-28 10:45:31,672 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:31,672 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2019-02-28 10:45:31,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:31,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:31,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:31,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:33,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:33,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:33,088 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:33,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:33,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:33,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:33,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:33,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:45:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:33,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 164 conjunts are in the unsatisfiable core [2019-02-28 10:45:33,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:33,259 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:33,259 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:33,268 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:33,268 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:35,147 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:38,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:38,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-02-28 10:45:38,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:38,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:45:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:45:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10309, Invalid=13561, Unknown=0, NotChecked=0, Total=23870 [2019-02-28 10:45:38,733 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2019-02-28 10:45:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:41,480 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-02-28 10:45:41,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:45:41,480 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2019-02-28 10:45:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:41,481 INFO L225 Difference]: With dead ends: 261 [2019-02-28 10:45:41,481 INFO L226 Difference]: Without dead ends: 260 [2019-02-28 10:45:41,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12746 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=16834, Invalid=24986, Unknown=0, NotChecked=0, Total=41820 [2019-02-28 10:45:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-02-28 10:45:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2019-02-28 10:45:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-02-28 10:45:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-02-28 10:45:41,535 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2019-02-28 10:45:41,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:41,535 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-02-28 10:45:41,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:45:41,535 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-02-28 10:45:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-02-28 10:45:41,536 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:41,537 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2019-02-28 10:45:41,537 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:41,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:41,537 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2019-02-28 10:45:41,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:41,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:45:41,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:41,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:43,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:43,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:43,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:43,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:43,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:43,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:43,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:45:43,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:45:43,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-28 10:45:43,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:43,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 169 conjunts are in the unsatisfiable core [2019-02-28 10:45:43,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:43,404 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:43,405 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:43,413 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:43,413 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:45,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:49,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:49,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-02-28 10:45:49,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:49,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:45:49,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:45:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10412, Invalid=13768, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:45:49,153 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2019-02-28 10:45:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:45:52,247 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-02-28 10:45:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:45:52,247 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2019-02-28 10:45:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:45:52,248 INFO L225 Difference]: With dead ends: 266 [2019-02-28 10:45:52,248 INFO L226 Difference]: Without dead ends: 265 [2019-02-28 10:45:52,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13347 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=17093, Invalid=25549, Unknown=0, NotChecked=0, Total=42642 [2019-02-28 10:45:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-02-28 10:45:52,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2019-02-28 10:45:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-28 10:45:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-02-28 10:45:52,297 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2019-02-28 10:45:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:45:52,298 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-02-28 10:45:52,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:45:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-02-28 10:45:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-28 10:45:52,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:45:52,299 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2019-02-28 10:45:52,299 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:45:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:45:52,299 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2019-02-28 10:45:52,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:45:52,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:52,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:45:52,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:45:52,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:45:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:45:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:53,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:53,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:45:53,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:45:53,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:45:53,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:45:53,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:45:53,818 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:45:53,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:45:53,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:45:53,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:45:53,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 172 conjunts are in the unsatisfiable core [2019-02-28 10:45:53,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:45:53,992 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:45:53,992 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:45:54,002 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:45:54,002 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:45:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:55,804 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:45:59,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:45:59,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:45:59,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-02-28 10:45:59,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:45:59,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-28 10:45:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-28 10:45:59,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10515, Invalid=13977, Unknown=0, NotChecked=0, Total=24492 [2019-02-28 10:45:59,562 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2019-02-28 10:46:02,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:02,463 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-02-28 10:46:02,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:46:02,463 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2019-02-28 10:46:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:02,464 INFO L225 Difference]: With dead ends: 271 [2019-02-28 10:46:02,464 INFO L226 Difference]: Without dead ends: 270 [2019-02-28 10:46:02,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13950 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=17353, Invalid=26119, Unknown=0, NotChecked=0, Total=43472 [2019-02-28 10:46:02,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-28 10:46:02,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-02-28 10:46:02,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-02-28 10:46:02,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-02-28 10:46:02,517 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2019-02-28 10:46:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:02,518 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-02-28 10:46:02,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-28 10:46:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-02-28 10:46:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-02-28 10:46:02,519 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:02,519 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2019-02-28 10:46:02,519 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2019-02-28 10:46:02,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:02,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:02,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:02,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:04,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:04,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:04,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:04,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:04,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:04,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:04,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:04,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:04,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 173 conjunts are in the unsatisfiable core [2019-02-28 10:46:04,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:04,598 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:04,599 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:04,609 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:04,609 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:06,477 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:10,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:10,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-02-28 10:46:10,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:10,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-28 10:46:10,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-28 10:46:10,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10618, Invalid=14188, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:46:10,376 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2019-02-28 10:46:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:13,352 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-02-28 10:46:13,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:46:13,353 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2019-02-28 10:46:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:13,354 INFO L225 Difference]: With dead ends: 276 [2019-02-28 10:46:13,354 INFO L226 Difference]: Without dead ends: 275 [2019-02-28 10:46:13,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 423 SyntacticMatches, 6 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14555 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=17614, Invalid=26696, Unknown=0, NotChecked=0, Total=44310 [2019-02-28 10:46:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-02-28 10:46:13,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-02-28 10:46:13,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-02-28 10:46:13,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-02-28 10:46:13,418 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2019-02-28 10:46:13,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:13,418 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2019-02-28 10:46:13,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-28 10:46:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2019-02-28 10:46:13,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-02-28 10:46:13,419 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:13,419 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2019-02-28 10:46:13,420 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:13,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:13,420 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2019-02-28 10:46:13,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:13,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:13,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:13,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:15,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:15,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:15,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:15,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:15,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:15,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:15,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:15,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:15,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-28 10:46:15,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:15,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 1152 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-28 10:46:15,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:15,665 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:15,665 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:15,677 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:15,678 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:17,554 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:21,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:21,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-02-28 10:46:21,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:21,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:46:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:46:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10721, Invalid=14401, Unknown=0, NotChecked=0, Total=25122 [2019-02-28 10:46:21,459 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2019-02-28 10:46:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:24,662 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-02-28 10:46:24,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:46:24,662 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2019-02-28 10:46:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:24,663 INFO L225 Difference]: With dead ends: 281 [2019-02-28 10:46:24,663 INFO L226 Difference]: Without dead ends: 280 [2019-02-28 10:46:24,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 431 SyntacticMatches, 8 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15162 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=17876, Invalid=27280, Unknown=0, NotChecked=0, Total=45156 [2019-02-28 10:46:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-02-28 10:46:24,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2019-02-28 10:46:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-28 10:46:24,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-28 10:46:24,732 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2019-02-28 10:46:24,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:24,732 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-28 10:46:24,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:46:24,733 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-28 10:46:24,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-28 10:46:24,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:24,734 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2019-02-28 10:46:24,734 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:24,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:24,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2019-02-28 10:46:24,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:24,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:24,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:24,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:24,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:26,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:26,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:26,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:26,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:26,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:26,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:26,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:46:26,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:46:26,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:46:26,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:26,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 181 conjunts are in the unsatisfiable core [2019-02-28 10:46:26,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:26,595 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:26,595 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:26,608 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:26,609 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:28,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:32,526 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:32,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:32,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-02-28 10:46:32,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:32,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-28 10:46:32,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-28 10:46:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10824, Invalid=14616, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:46:32,548 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2019-02-28 10:46:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:35,946 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-02-28 10:46:35,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:46:35,946 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2019-02-28 10:46:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:35,947 INFO L225 Difference]: With dead ends: 286 [2019-02-28 10:46:35,948 INFO L226 Difference]: Without dead ends: 285 [2019-02-28 10:46:35,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 439 SyntacticMatches, 10 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15771 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18139, Invalid=27871, Unknown=0, NotChecked=0, Total=46010 [2019-02-28 10:46:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-02-28 10:46:36,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-02-28 10:46:36,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-02-28 10:46:36,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2019-02-28 10:46:36,015 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2019-02-28 10:46:36,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:36,015 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2019-02-28 10:46:36,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-28 10:46:36,015 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2019-02-28 10:46:36,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-02-28 10:46:36,016 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:36,016 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2019-02-28 10:46:36,016 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:36,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:36,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2019-02-28 10:46:36,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:36,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:36,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:36,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:36,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:37,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:37,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:37,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:37,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:37,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:37,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:37,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:37,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:46:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:37,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 182 conjunts are in the unsatisfiable core [2019-02-28 10:46:37,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:37,914 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:37,914 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:37,924 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:37,924 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:40,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:40,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:44,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:44,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-02-28 10:46:44,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:44,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-28 10:46:44,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-28 10:46:44,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10927, Invalid=14833, Unknown=0, NotChecked=0, Total=25760 [2019-02-28 10:46:44,107 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2019-02-28 10:46:47,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:47,602 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-28 10:46:47,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:46:47,602 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2019-02-28 10:46:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:47,603 INFO L225 Difference]: With dead ends: 291 [2019-02-28 10:46:47,603 INFO L226 Difference]: Without dead ends: 290 [2019-02-28 10:46:47,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 447 SyntacticMatches, 12 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16382 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=18403, Invalid=28469, Unknown=0, NotChecked=0, Total=46872 [2019-02-28 10:46:47,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-28 10:46:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-02-28 10:46:47,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-02-28 10:46:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-02-28 10:46:47,661 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2019-02-28 10:46:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:47,662 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-02-28 10:46:47,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-28 10:46:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-02-28 10:46:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-02-28 10:46:47,663 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:47,663 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2019-02-28 10:46:47,663 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:47,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:47,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2019-02-28 10:46:47,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:47,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:46:47,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:47,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:46:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:49,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:49,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:46:49,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:46:49,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:46:49,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:46:49,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:46:49,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:46:49,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:46:49,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-28 10:46:49,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:46:49,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 187 conjunts are in the unsatisfiable core [2019-02-28 10:46:49,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:46:49,910 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:46:49,910 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:46:49,921 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:46:49,921 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:46:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:52,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:46:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:46:56,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:46:56,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-02-28 10:46:56,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:46:56,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-28 10:46:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-28 10:46:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11030, Invalid=15052, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:46:56,406 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2019-02-28 10:46:59,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:46:59,766 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2019-02-28 10:46:59,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:46:59,766 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2019-02-28 10:46:59,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:46:59,767 INFO L225 Difference]: With dead ends: 296 [2019-02-28 10:46:59,767 INFO L226 Difference]: Without dead ends: 295 [2019-02-28 10:46:59,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 455 SyntacticMatches, 14 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16995 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=18668, Invalid=29074, Unknown=0, NotChecked=0, Total=47742 [2019-02-28 10:46:59,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-02-28 10:46:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2019-02-28 10:46:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-02-28 10:46:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-02-28 10:46:59,834 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2019-02-28 10:46:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:46:59,834 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-02-28 10:46:59,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-28 10:46:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-02-28 10:46:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-02-28 10:46:59,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:46:59,835 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2019-02-28 10:46:59,836 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:46:59,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:46:59,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2019-02-28 10:46:59,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:46:59,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:59,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:46:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:46:59,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:46:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:01,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:01,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:01,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:01,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:01,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:01,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:01,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:01,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:02,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:02,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:02,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-28 10:47:02,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:02,094 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:02,094 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:02,105 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:02,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:04,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:08,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:08,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-02-28 10:47:08,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:08,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-28 10:47:08,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-28 10:47:08,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11133, Invalid=15273, Unknown=0, NotChecked=0, Total=26406 [2019-02-28 10:47:08,462 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2019-02-28 10:47:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:12,191 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-02-28 10:47:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:47:12,191 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2019-02-28 10:47:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:12,192 INFO L225 Difference]: With dead ends: 301 [2019-02-28 10:47:12,192 INFO L226 Difference]: Without dead ends: 300 [2019-02-28 10:47:12,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 463 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17610 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=18934, Invalid=29686, Unknown=0, NotChecked=0, Total=48620 [2019-02-28 10:47:12,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-02-28 10:47:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-02-28 10:47:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-02-28 10:47:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-02-28 10:47:12,256 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2019-02-28 10:47:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:12,257 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-02-28 10:47:12,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-28 10:47:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-02-28 10:47:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-02-28 10:47:12,258 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:12,258 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2019-02-28 10:47:12,259 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:12,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:12,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2019-02-28 10:47:12,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:12,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:12,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:12,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:12,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:14,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:14,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:14,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:14,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:14,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:14,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:14,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:14,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:14,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 191 conjunts are in the unsatisfiable core [2019-02-28 10:47:14,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:14,338 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:14,338 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:14,347 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:14,347 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:16,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:20,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:20,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-02-28 10:47:20,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:20,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-28 10:47:20,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-28 10:47:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11236, Invalid=15496, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:47:20,683 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2019-02-28 10:47:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:24,332 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-02-28 10:47:24,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:47:24,332 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2019-02-28 10:47:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:24,333 INFO L225 Difference]: With dead ends: 306 [2019-02-28 10:47:24,333 INFO L226 Difference]: Without dead ends: 305 [2019-02-28 10:47:24,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 471 SyntacticMatches, 18 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18227 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=19201, Invalid=30305, Unknown=0, NotChecked=0, Total=49506 [2019-02-28 10:47:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-02-28 10:47:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2019-02-28 10:47:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-02-28 10:47:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-02-28 10:47:24,408 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2019-02-28 10:47:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:24,408 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2019-02-28 10:47:24,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-28 10:47:24,409 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2019-02-28 10:47:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-02-28 10:47:24,410 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:24,410 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2019-02-28 10:47:24,410 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:24,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:24,410 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2019-02-28 10:47:24,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:24,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:24,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:24,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:24,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:26,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:26,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:26,629 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:26,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:26,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:26,629 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:26,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:47:26,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:47:27,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-28 10:47:27,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:27,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 196 conjunts are in the unsatisfiable core [2019-02-28 10:47:27,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:27,140 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:27,140 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:27,153 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:27,153 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:29,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:33,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:33,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-02-28 10:47:33,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:33,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-28 10:47:33,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-28 10:47:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11339, Invalid=15721, Unknown=0, NotChecked=0, Total=27060 [2019-02-28 10:47:33,547 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2019-02-28 10:47:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:37,471 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-02-28 10:47:37,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:47:37,476 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2019-02-28 10:47:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:37,477 INFO L225 Difference]: With dead ends: 311 [2019-02-28 10:47:37,478 INFO L226 Difference]: Without dead ends: 310 [2019-02-28 10:47:37,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 479 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=19469, Invalid=30931, Unknown=0, NotChecked=0, Total=50400 [2019-02-28 10:47:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-02-28 10:47:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-02-28 10:47:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-02-28 10:47:37,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-02-28 10:47:37,549 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2019-02-28 10:47:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:37,549 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-02-28 10:47:37,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-28 10:47:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-02-28 10:47:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-02-28 10:47:37,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:37,551 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2019-02-28 10:47:37,551 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:37,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:37,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2019-02-28 10:47:37,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:37,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:37,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:37,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:39,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:39,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:39,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:39,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:39,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:39,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:39,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:47:39,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:47:39,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:47:39,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:47:39,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1299 conjuncts, 199 conjunts are in the unsatisfiable core [2019-02-28 10:47:39,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:39,736 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:39,736 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:39,747 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:39,747 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:42,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:46,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:46,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-02-28 10:47:46,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:46,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-28 10:47:46,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-28 10:47:46,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11442, Invalid=15948, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:47:46,287 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 126 states. [2019-02-28 10:47:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:47:50,202 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2019-02-28 10:47:50,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:47:50,203 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 306 [2019-02-28 10:47:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:47:50,204 INFO L225 Difference]: With dead ends: 316 [2019-02-28 10:47:50,204 INFO L226 Difference]: Without dead ends: 315 [2019-02-28 10:47:50,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 487 SyntacticMatches, 22 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19467 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19738, Invalid=31564, Unknown=0, NotChecked=0, Total=51302 [2019-02-28 10:47:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-28 10:47:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-02-28 10:47:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-02-28 10:47:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2019-02-28 10:47:50,279 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 306 [2019-02-28 10:47:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:47:50,279 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2019-02-28 10:47:50,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-28 10:47:50,280 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2019-02-28 10:47:50,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-02-28 10:47:50,280 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:47:50,281 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1, 1] [2019-02-28 10:47:50,281 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:47:50,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:47:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash -291628847, now seen corresponding path program 61 times [2019-02-28 10:47:50,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:47:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:50,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:47:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:47:50,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:47:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:52,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:52,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:47:52,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:47:52,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:47:52,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:47:52,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:47:52,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:47:52,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:47:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:47:52,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 1320 conjuncts, 200 conjunts are in the unsatisfiable core [2019-02-28 10:47:52,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:47:52,835 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:47:52,835 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:47:52,844 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:47:52,844 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:47:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:55,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:47:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:47:59,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:47:59,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-02-28 10:47:59,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:47:59,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-28 10:47:59,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-28 10:47:59,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11545, Invalid=16177, Unknown=0, NotChecked=0, Total=27722 [2019-02-28 10:47:59,484 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 128 states. [2019-02-28 10:48:03,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:03,477 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-02-28 10:48:03,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:48:03,478 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 311 [2019-02-28 10:48:03,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:03,479 INFO L225 Difference]: With dead ends: 321 [2019-02-28 10:48:03,479 INFO L226 Difference]: Without dead ends: 320 [2019-02-28 10:48:03,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 495 SyntacticMatches, 24 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20090 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=20008, Invalid=32204, Unknown=0, NotChecked=0, Total=52212 [2019-02-28 10:48:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-02-28 10:48:03,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2019-02-28 10:48:03,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-02-28 10:48:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-02-28 10:48:03,551 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 311 [2019-02-28 10:48:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:03,551 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-02-28 10:48:03,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-28 10:48:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-02-28 10:48:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-02-28 10:48:03,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:03,553 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1, 1] [2019-02-28 10:48:03,553 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:03,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:03,553 INFO L82 PathProgramCache]: Analyzing trace with hash -537565849, now seen corresponding path program 62 times [2019-02-28 10:48:03,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:03,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:03,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:03,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:03,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:05,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:05,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:05,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:05,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:05,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:05,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:05,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:05,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:06,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-28 10:48:06,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:06,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 205 conjunts are in the unsatisfiable core [2019-02-28 10:48:06,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:06,157 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:06,157 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:06,170 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:06,170 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:09,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:13,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:13,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-02-28 10:48:13,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:13,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-28 10:48:13,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-28 10:48:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11648, Invalid=16408, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:48:13,253 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 130 states. [2019-02-28 10:48:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:17,384 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-02-28 10:48:17,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:48:17,384 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 316 [2019-02-28 10:48:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:17,386 INFO L225 Difference]: With dead ends: 326 [2019-02-28 10:48:17,386 INFO L226 Difference]: Without dead ends: 325 [2019-02-28 10:48:17,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 503 SyntacticMatches, 26 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20715 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=20279, Invalid=32851, Unknown=0, NotChecked=0, Total=53130 [2019-02-28 10:48:17,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-28 10:48:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2019-02-28 10:48:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-02-28 10:48:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2019-02-28 10:48:17,460 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 316 [2019-02-28 10:48:17,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:17,461 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2019-02-28 10:48:17,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-28 10:48:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2019-02-28 10:48:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-02-28 10:48:17,462 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:17,462 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1, 1] [2019-02-28 10:48:17,462 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:17,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash -582711663, now seen corresponding path program 63 times [2019-02-28 10:48:17,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:17,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:17,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:17,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:19,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:19,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:19,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:19,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:19,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:19,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:19,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:48:19,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:48:19,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:48:19,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:19,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 208 conjunts are in the unsatisfiable core [2019-02-28 10:48:19,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:19,912 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:19,912 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:19,921 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:19,921 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:22,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:22,783 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:26,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:26,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-02-28 10:48:26,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:26,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-28 10:48:26,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-28 10:48:26,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11751, Invalid=16641, Unknown=0, NotChecked=0, Total=28392 [2019-02-28 10:48:26,838 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 132 states. [2019-02-28 10:48:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:30,922 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-02-28 10:48:30,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:48:30,923 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 321 [2019-02-28 10:48:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:30,924 INFO L225 Difference]: With dead ends: 331 [2019-02-28 10:48:30,924 INFO L226 Difference]: Without dead ends: 330 [2019-02-28 10:48:30,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 511 SyntacticMatches, 28 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21342 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=20551, Invalid=33505, Unknown=0, NotChecked=0, Total=54056 [2019-02-28 10:48:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-02-28 10:48:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2019-02-28 10:48:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-02-28 10:48:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-02-28 10:48:31,000 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 321 [2019-02-28 10:48:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:31,000 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-02-28 10:48:31,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-28 10:48:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-02-28 10:48:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-02-28 10:48:31,001 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:31,001 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1, 1] [2019-02-28 10:48:31,002 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1894616999, now seen corresponding path program 64 times [2019-02-28 10:48:31,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:31,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:31,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:31,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:33,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:33,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:33,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:33,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:33,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:33,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:33,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:33,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:48:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:33,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 1383 conjuncts, 209 conjunts are in the unsatisfiable core [2019-02-28 10:48:33,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:33,736 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:33,736 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:33,742 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:33,742 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:36,472 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:40,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:40,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-02-28 10:48:40,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:40,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-28 10:48:40,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-28 10:48:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11854, Invalid=16876, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:48:40,717 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 134 states. [2019-02-28 10:48:45,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:45,126 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2019-02-28 10:48:45,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:48:45,126 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 326 [2019-02-28 10:48:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:45,127 INFO L225 Difference]: With dead ends: 336 [2019-02-28 10:48:45,127 INFO L226 Difference]: Without dead ends: 335 [2019-02-28 10:48:45,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 519 SyntacticMatches, 30 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21971 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20824, Invalid=34166, Unknown=0, NotChecked=0, Total=54990 [2019-02-28 10:48:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-02-28 10:48:45,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2019-02-28 10:48:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-02-28 10:48:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2019-02-28 10:48:45,207 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 326 [2019-02-28 10:48:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:45,207 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2019-02-28 10:48:45,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-28 10:48:45,207 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2019-02-28 10:48:45,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-02-28 10:48:45,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:45,208 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1, 1] [2019-02-28 10:48:45,209 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:45,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1074578513, now seen corresponding path program 65 times [2019-02-28 10:48:45,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:45,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:45,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:48:45,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:45,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:48:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:47,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:47,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:48:47,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:48:47,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:48:47,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:48:47,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:48:47,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:48:47,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:48:48,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-28 10:48:48,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:48:48,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-28 10:48:48,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:48:48,040 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:48:48,040 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:48:48,051 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:48:48,051 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:48:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:50,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:48:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:48:54,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:48:54,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-02-28 10:48:54,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:48:54,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-28 10:48:54,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-28 10:48:54,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11957, Invalid=17113, Unknown=0, NotChecked=0, Total=29070 [2019-02-28 10:48:54,977 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 136 states. [2019-02-28 10:48:59,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:48:59,515 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-02-28 10:48:59,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:48:59,515 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 331 [2019-02-28 10:48:59,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:48:59,516 INFO L225 Difference]: With dead ends: 341 [2019-02-28 10:48:59,517 INFO L226 Difference]: Without dead ends: 340 [2019-02-28 10:48:59,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 527 SyntacticMatches, 32 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22602 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=21098, Invalid=34834, Unknown=0, NotChecked=0, Total=55932 [2019-02-28 10:48:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-02-28 10:48:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2019-02-28 10:48:59,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-02-28 10:48:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-02-28 10:48:59,597 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 331 [2019-02-28 10:48:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:48:59,597 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-02-28 10:48:59,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-28 10:48:59,598 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-02-28 10:48:59,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-02-28 10:48:59,599 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:48:59,599 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1, 1] [2019-02-28 10:48:59,599 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:48:59,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:48:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash -362419737, now seen corresponding path program 66 times [2019-02-28 10:48:59,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:48:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:59,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:48:59,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:48:59,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:48:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:02,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:02,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:02,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:02,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:02,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:02,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:02,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:02,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:02,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:02,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:02,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1425 conjuncts, 217 conjunts are in the unsatisfiable core [2019-02-28 10:49:02,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:02,263 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:02,263 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:02,271 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:02,271 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:05,309 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:09,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:09,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-02-28 10:49:09,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:09,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-28 10:49:09,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-28 10:49:09,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12060, Invalid=17352, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:49:09,608 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 138 states. [2019-02-28 10:49:14,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:14,163 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-02-28 10:49:14,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:49:14,163 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 336 [2019-02-28 10:49:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:14,165 INFO L225 Difference]: With dead ends: 346 [2019-02-28 10:49:14,165 INFO L226 Difference]: Without dead ends: 345 [2019-02-28 10:49:14,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 535 SyntacticMatches, 34 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23235 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21373, Invalid=35509, Unknown=0, NotChecked=0, Total=56882 [2019-02-28 10:49:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-02-28 10:49:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2019-02-28 10:49:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-02-28 10:49:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2019-02-28 10:49:14,248 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 336 [2019-02-28 10:49:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:14,248 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2019-02-28 10:49:14,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-28 10:49:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2019-02-28 10:49:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-02-28 10:49:14,250 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:14,250 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1, 1] [2019-02-28 10:49:14,251 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:49:14,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash -218967535, now seen corresponding path program 67 times [2019-02-28 10:49:14,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:14,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:14,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:16,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:16,688 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:16,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:16,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:16,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:16,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:16,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:16,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:49:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:16,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 1446 conjuncts, 218 conjunts are in the unsatisfiable core [2019-02-28 10:49:16,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:16,916 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:16,916 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:16,925 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:16,925 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:20,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:24,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:24,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-02-28 10:49:24,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:24,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-28 10:49:24,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-28 10:49:24,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12163, Invalid=17593, Unknown=0, NotChecked=0, Total=29756 [2019-02-28 10:49:24,387 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 140 states. [2019-02-28 10:49:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:29,142 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-02-28 10:49:29,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:49:29,143 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 341 [2019-02-28 10:49:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:29,144 INFO L225 Difference]: With dead ends: 351 [2019-02-28 10:49:29,144 INFO L226 Difference]: Without dead ends: 350 [2019-02-28 10:49:29,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 543 SyntacticMatches, 36 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23870 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=21649, Invalid=36191, Unknown=0, NotChecked=0, Total=57840 [2019-02-28 10:49:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-28 10:49:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-02-28 10:49:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-02-28 10:49:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-02-28 10:49:29,230 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 341 [2019-02-28 10:49:29,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:29,230 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-02-28 10:49:29,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-28 10:49:29,230 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-02-28 10:49:29,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-02-28 10:49:29,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:29,232 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1, 1] [2019-02-28 10:49:29,232 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:49:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:29,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1914538969, now seen corresponding path program 68 times [2019-02-28 10:49:29,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:29,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:49:29,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:29,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:31,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:31,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:31,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:31,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:31,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:31,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:31,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:49:31,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:49:32,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-28 10:49:32,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:32,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 223 conjunts are in the unsatisfiable core [2019-02-28 10:49:32,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:32,393 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:32,394 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:32,401 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:32,401 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:35,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:40,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:40,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:40,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-02-28 10:49:40,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:40,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-28 10:49:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-28 10:49:40,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12266, Invalid=17836, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:49:40,101 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 142 states. [2019-02-28 10:49:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:49:44,953 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2019-02-28 10:49:44,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:49:44,953 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 346 [2019-02-28 10:49:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:49:44,954 INFO L225 Difference]: With dead ends: 356 [2019-02-28 10:49:44,954 INFO L226 Difference]: Without dead ends: 355 [2019-02-28 10:49:44,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 551 SyntacticMatches, 38 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24507 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21926, Invalid=36880, Unknown=0, NotChecked=0, Total=58806 [2019-02-28 10:49:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-02-28 10:49:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-02-28 10:49:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-02-28 10:49:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2019-02-28 10:49:45,043 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 346 [2019-02-28 10:49:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:49:45,044 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2019-02-28 10:49:45,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-28 10:49:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2019-02-28 10:49:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-02-28 10:49:45,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:49:45,045 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1, 1] [2019-02-28 10:49:45,045 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:49:45,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:49:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 116568017, now seen corresponding path program 69 times [2019-02-28 10:49:45,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:49:45,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:45,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:49:45,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:49:45,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:49:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:49:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:47,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:47,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:49:47,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:49:47,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:49:47,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:49:47,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:49:47,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:49:47,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:49:47,847 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:49:47,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:49:47,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 1488 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-28 10:49:47,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:49:47,861 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:49:47,861 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:49:47,869 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:49:47,870 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:49:51,324 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:51,324 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:49:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:49:55,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:49:55,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-02-28 10:49:55,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:49:55,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-28 10:49:55,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-28 10:49:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12369, Invalid=18081, Unknown=0, NotChecked=0, Total=30450 [2019-02-28 10:49:55,721 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 144 states. [2019-02-28 10:50:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:00,708 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-02-28 10:50:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:50:00,708 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 351 [2019-02-28 10:50:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:00,710 INFO L225 Difference]: With dead ends: 361 [2019-02-28 10:50:00,710 INFO L226 Difference]: Without dead ends: 360 [2019-02-28 10:50:00,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 559 SyntacticMatches, 40 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25146 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=22204, Invalid=37576, Unknown=0, NotChecked=0, Total=59780 [2019-02-28 10:50:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-02-28 10:50:00,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2019-02-28 10:50:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-02-28 10:50:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-02-28 10:50:00,800 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 351 [2019-02-28 10:50:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:00,800 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-02-28 10:50:00,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-28 10:50:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-02-28 10:50:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-02-28 10:50:00,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:00,802 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1, 1] [2019-02-28 10:50:00,802 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:50:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2014892441, now seen corresponding path program 70 times [2019-02-28 10:50:00,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:00,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:00,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:03,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:03,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:03,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:03,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:03,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:03,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:03,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:03,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:50:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:03,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 1509 conjuncts, 227 conjunts are in the unsatisfiable core [2019-02-28 10:50:03,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:03,669 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:03,669 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:03,680 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:03,680 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:06,999 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:11,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:11,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-02-28 10:50:11,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:11,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-28 10:50:11,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-28 10:50:11,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12472, Invalid=18328, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:50:11,614 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 146 states. [2019-02-28 10:50:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:16,610 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-02-28 10:50:16,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:50:16,611 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 356 [2019-02-28 10:50:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:16,612 INFO L225 Difference]: With dead ends: 366 [2019-02-28 10:50:16,612 INFO L226 Difference]: Without dead ends: 365 [2019-02-28 10:50:16,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 567 SyntacticMatches, 42 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25787 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22483, Invalid=38279, Unknown=0, NotChecked=0, Total=60762 [2019-02-28 10:50:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-02-28 10:50:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2019-02-28 10:50:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-02-28 10:50:16,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2019-02-28 10:50:16,708 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 356 [2019-02-28 10:50:16,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:16,708 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2019-02-28 10:50:16,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-28 10:50:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2019-02-28 10:50:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-02-28 10:50:16,710 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:16,710 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1, 1] [2019-02-28 10:50:16,710 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:50:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2113380975, now seen corresponding path program 71 times [2019-02-28 10:50:16,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:16,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:16,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:19,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:19,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:19,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:19,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:19,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:19,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:19,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:50:19,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:50:20,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-28 10:50:20,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:20,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 232 conjunts are in the unsatisfiable core [2019-02-28 10:50:20,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:20,067 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:20,067 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:20,077 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:20,077 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:23,522 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:27,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:27,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-02-28 10:50:27,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:27,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-28 10:50:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-28 10:50:27,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12575, Invalid=18577, Unknown=0, NotChecked=0, Total=31152 [2019-02-28 10:50:27,918 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 148 states. [2019-02-28 10:50:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:33,092 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-02-28 10:50:33,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:50:33,093 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 361 [2019-02-28 10:50:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:33,094 INFO L225 Difference]: With dead ends: 371 [2019-02-28 10:50:33,094 INFO L226 Difference]: Without dead ends: 370 [2019-02-28 10:50:33,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 575 SyntacticMatches, 44 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26430 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22763, Invalid=38989, Unknown=0, NotChecked=0, Total=61752 [2019-02-28 10:50:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-02-28 10:50:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2019-02-28 10:50:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-28 10:50:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2019-02-28 10:50:33,191 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 361 [2019-02-28 10:50:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:33,191 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2019-02-28 10:50:33,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-28 10:50:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2019-02-28 10:50:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-02-28 10:50:33,193 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:33,193 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1, 1] [2019-02-28 10:50:33,193 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:50:33,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:33,193 INFO L82 PathProgramCache]: Analyzing trace with hash 804788391, now seen corresponding path program 72 times [2019-02-28 10:50:33,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:33,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:33,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:33,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:36,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:36,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:36,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:36,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:36,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:36,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:36,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:50:36,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:50:36,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:50:36,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:50:36,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 235 conjunts are in the unsatisfiable core [2019-02-28 10:50:36,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:36,540 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:36,540 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:36,552 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:36,552 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:39,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:50:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:44,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:50:44,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-02-28 10:50:44,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:50:44,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-28 10:50:44,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-28 10:50:44,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12678, Invalid=18828, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:50:44,381 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 150 states. [2019-02-28 10:50:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:50:49,736 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2019-02-28 10:50:49,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:50:49,736 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 366 [2019-02-28 10:50:49,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:50:49,738 INFO L225 Difference]: With dead ends: 376 [2019-02-28 10:50:49,738 INFO L226 Difference]: Without dead ends: 375 [2019-02-28 10:50:49,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 583 SyntacticMatches, 46 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27075 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23044, Invalid=39706, Unknown=0, NotChecked=0, Total=62750 [2019-02-28 10:50:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-02-28 10:50:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-02-28 10:50:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-02-28 10:50:49,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2019-02-28 10:50:49,840 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 366 [2019-02-28 10:50:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:50:49,841 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2019-02-28 10:50:49,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-28 10:50:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2019-02-28 10:50:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-02-28 10:50:49,842 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:50:49,842 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1, 1] [2019-02-28 10:50:49,842 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:50:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:50:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash 523230033, now seen corresponding path program 73 times [2019-02-28 10:50:49,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:50:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:49,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:50:49,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:50:49,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:50:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:52,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:52,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:50:52,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:50:52,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:50:52,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:50:52,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:50:52,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:50:52,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:50:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:50:53,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 1572 conjuncts, 236 conjunts are in the unsatisfiable core [2019-02-28 10:50:53,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:50:53,117 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:50:53,117 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:50:53,128 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:50:53,128 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:50:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:50:56,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:01,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:01,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-02-28 10:51:01,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:01,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-28 10:51:01,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-28 10:51:01,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12781, Invalid=19081, Unknown=0, NotChecked=0, Total=31862 [2019-02-28 10:51:01,025 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 152 states. [2019-02-28 10:51:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:06,525 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2019-02-28 10:51:06,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:51:06,525 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 371 [2019-02-28 10:51:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:06,526 INFO L225 Difference]: With dead ends: 381 [2019-02-28 10:51:06,527 INFO L226 Difference]: Without dead ends: 380 [2019-02-28 10:51:06,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 591 SyntacticMatches, 48 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27722 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=23326, Invalid=40430, Unknown=0, NotChecked=0, Total=63756 [2019-02-28 10:51:06,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-28 10:51:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2019-02-28 10:51:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-02-28 10:51:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-02-28 10:51:06,631 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 371 [2019-02-28 10:51:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:06,631 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-02-28 10:51:06,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-28 10:51:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-02-28 10:51:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-02-28 10:51:06,633 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:06,633 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1, 1] [2019-02-28 10:51:06,633 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:51:06,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:06,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1217999591, now seen corresponding path program 74 times [2019-02-28 10:51:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:06,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:06,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:09,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:09,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:09,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:09,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:09,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:09,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:09,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:09,537 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:51:09,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:51:10,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-28 10:51:10,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:51:10,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1593 conjuncts, 241 conjunts are in the unsatisfiable core [2019-02-28 10:51:10,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:10,216 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:10,216 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:10,226 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:10,226 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:13,866 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:18,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:18,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-02-28 10:51:18,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:18,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-28 10:51:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-28 10:51:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12884, Invalid=19336, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:51:18,459 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 154 states. [2019-02-28 10:51:23,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:23,999 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-02-28 10:51:23,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:51:23,999 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 376 [2019-02-28 10:51:24,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:24,001 INFO L225 Difference]: With dead ends: 386 [2019-02-28 10:51:24,001 INFO L226 Difference]: Without dead ends: 385 [2019-02-28 10:51:24,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 599 SyntacticMatches, 50 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28371 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23609, Invalid=41161, Unknown=0, NotChecked=0, Total=64770 [2019-02-28 10:51:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-02-28 10:51:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2019-02-28 10:51:24,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-02-28 10:51:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2019-02-28 10:51:24,106 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 376 [2019-02-28 10:51:24,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:24,106 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2019-02-28 10:51:24,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-28 10:51:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2019-02-28 10:51:24,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-02-28 10:51:24,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:24,108 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1, 1] [2019-02-28 10:51:24,108 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:51:24,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:24,108 INFO L82 PathProgramCache]: Analyzing trace with hash 241510673, now seen corresponding path program 75 times [2019-02-28 10:51:24,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:24,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:24,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:24,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:27,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:27,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:27,218 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:27,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:27,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:27,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:27,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:51:27,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:51:27,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:51:27,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:51:27,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 1614 conjuncts, 244 conjunts are in the unsatisfiable core [2019-02-28 10:51:27,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:27,501 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:27,501 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:27,509 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:27,509 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:31,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:35,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:35,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-02-28 10:51:35,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:35,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-28 10:51:35,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-28 10:51:35,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12987, Invalid=19593, Unknown=0, NotChecked=0, Total=32580 [2019-02-28 10:51:35,529 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 156 states. [2019-02-28 10:51:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:41,265 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-02-28 10:51:41,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:51:41,265 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 381 [2019-02-28 10:51:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:41,267 INFO L225 Difference]: With dead ends: 391 [2019-02-28 10:51:41,267 INFO L226 Difference]: Without dead ends: 390 [2019-02-28 10:51:41,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 607 SyntacticMatches, 52 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29022 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23893, Invalid=41899, Unknown=0, NotChecked=0, Total=65792 [2019-02-28 10:51:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-02-28 10:51:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2019-02-28 10:51:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-02-28 10:51:41,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2019-02-28 10:51:41,376 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 381 [2019-02-28 10:51:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:41,376 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2019-02-28 10:51:41,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-28 10:51:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2019-02-28 10:51:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-02-28 10:51:41,378 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:41,378 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1, 1] [2019-02-28 10:51:41,378 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:51:41,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:41,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1062108455, now seen corresponding path program 76 times [2019-02-28 10:51:41,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:41,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:41,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:51:41,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:41,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:44,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:44,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:51:44,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:51:44,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:51:44,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:51:44,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:51:44,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:44,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:51:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:51:44,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 245 conjunts are in the unsatisfiable core [2019-02-28 10:51:44,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:51:44,939 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:51:44,939 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:51:44,947 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:51:44,947 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:51:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:48,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:51:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:51:53,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:51:53,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-02-28 10:51:53,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:51:53,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-28 10:51:53,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-28 10:51:53,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13090, Invalid=19852, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:51:53,371 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 158 states. [2019-02-28 10:51:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:51:59,189 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2019-02-28 10:51:59,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:51:59,190 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 386 [2019-02-28 10:51:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:51:59,191 INFO L225 Difference]: With dead ends: 396 [2019-02-28 10:51:59,191 INFO L226 Difference]: Without dead ends: 395 [2019-02-28 10:51:59,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 615 SyntacticMatches, 54 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29675 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=24178, Invalid=42644, Unknown=0, NotChecked=0, Total=66822 [2019-02-28 10:51:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-02-28 10:51:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2019-02-28 10:51:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-02-28 10:51:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2019-02-28 10:51:59,305 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 386 [2019-02-28 10:51:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:51:59,305 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2019-02-28 10:51:59,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-28 10:51:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2019-02-28 10:51:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-02-28 10:51:59,306 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:51:59,307 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1, 1] [2019-02-28 10:51:59,307 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:51:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:51:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1264302383, now seen corresponding path program 77 times [2019-02-28 10:51:59,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:51:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:59,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:51:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:51:59,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:51:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:02,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:02,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:02,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:02,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:02,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:02,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:02,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:52:02,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:52:03,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-28 10:52:03,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:03,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1656 conjuncts, 250 conjunts are in the unsatisfiable core [2019-02-28 10:52:03,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:03,231 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:03,231 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:03,242 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:03,242 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:06,945 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:11,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:11,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-02-28 10:52:11,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:11,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-28 10:52:11,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-28 10:52:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13193, Invalid=20113, Unknown=0, NotChecked=0, Total=33306 [2019-02-28 10:52:11,440 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 160 states. [2019-02-28 10:52:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:17,375 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2019-02-28 10:52:17,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:52:17,375 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 391 [2019-02-28 10:52:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:17,376 INFO L225 Difference]: With dead ends: 401 [2019-02-28 10:52:17,376 INFO L226 Difference]: Without dead ends: 400 [2019-02-28 10:52:17,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 623 SyntacticMatches, 56 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30330 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=24464, Invalid=43396, Unknown=0, NotChecked=0, Total=67860 [2019-02-28 10:52:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-02-28 10:52:17,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2019-02-28 10:52:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-02-28 10:52:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-02-28 10:52:17,493 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 391 [2019-02-28 10:52:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:17,493 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-02-28 10:52:17,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-28 10:52:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-02-28 10:52:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-02-28 10:52:17,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:17,495 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1, 1] [2019-02-28 10:52:17,495 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:52:17,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:17,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1822160743, now seen corresponding path program 78 times [2019-02-28 10:52:17,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:17,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:17,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:17,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:17,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:20,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:20,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:20,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:20,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:20,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:20,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:20,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:52:20,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:52:21,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:52:21,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:21,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 1677 conjuncts, 253 conjunts are in the unsatisfiable core [2019-02-28 10:52:21,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:21,095 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:21,095 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:21,105 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:21,105 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:25,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:29,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:29,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-02-28 10:52:29,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:29,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-28 10:52:29,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-28 10:52:29,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13296, Invalid=20376, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:52:29,809 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 162 states. [2019-02-28 10:52:35,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:35,995 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2019-02-28 10:52:35,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:52:35,996 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 396 [2019-02-28 10:52:35,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:35,997 INFO L225 Difference]: With dead ends: 406 [2019-02-28 10:52:35,997 INFO L226 Difference]: Without dead ends: 405 [2019-02-28 10:52:35,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 631 SyntacticMatches, 58 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30987 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24751, Invalid=44155, Unknown=0, NotChecked=0, Total=68906 [2019-02-28 10:52:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-02-28 10:52:36,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-02-28 10:52:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-02-28 10:52:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2019-02-28 10:52:36,117 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 396 [2019-02-28 10:52:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:36,117 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2019-02-28 10:52:36,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-28 10:52:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2019-02-28 10:52:36,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-02-28 10:52:36,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:36,119 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1, 1] [2019-02-28 10:52:36,119 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:52:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1810445457, now seen corresponding path program 79 times [2019-02-28 10:52:36,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:36,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:52:36,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:36,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:39,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:39,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:39,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:39,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:39,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:39,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:39,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:39,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:39,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:52:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:39,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 1698 conjuncts, 254 conjunts are in the unsatisfiable core [2019-02-28 10:52:39,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:39,850 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:39,850 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,858 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:39,859 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:52:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:44,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:52:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:48,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:52:48,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-02-28 10:52:48,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:52:48,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-28 10:52:48,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-28 10:52:48,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13399, Invalid=20641, Unknown=0, NotChecked=0, Total=34040 [2019-02-28 10:52:48,399 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 164 states. [2019-02-28 10:52:54,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:52:54,583 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2019-02-28 10:52:54,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:52:54,584 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 401 [2019-02-28 10:52:54,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:52:54,585 INFO L225 Difference]: With dead ends: 411 [2019-02-28 10:52:54,585 INFO L226 Difference]: Without dead ends: 410 [2019-02-28 10:52:54,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 639 SyntacticMatches, 60 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31646 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=25039, Invalid=44921, Unknown=0, NotChecked=0, Total=69960 [2019-02-28 10:52:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-28 10:52:54,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2019-02-28 10:52:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-02-28 10:52:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2019-02-28 10:52:54,707 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 401 [2019-02-28 10:52:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:52:54,707 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2019-02-28 10:52:54,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-28 10:52:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2019-02-28 10:52:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-02-28 10:52:54,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:52:54,709 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1, 1] [2019-02-28 10:52:54,709 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:52:54,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:52:54,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1409655207, now seen corresponding path program 80 times [2019-02-28 10:52:54,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:52:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:54,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:52:54,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:52:54,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:52:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:52:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:52:58,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:58,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:52:58,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:52:58,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:52:58,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:52:58,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:52:58,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:52:58,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:52:58,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-28 10:52:58,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:52:58,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 259 conjunts are in the unsatisfiable core [2019-02-28 10:52:58,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:52:58,832 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:52:58,833 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,842 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:52:58,842 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:02,961 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:07,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:07,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-02-28 10:53:07,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:07,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-28 10:53:07,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-28 10:53:07,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13502, Invalid=20908, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:53:07,614 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 166 states. [2019-02-28 10:53:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:14,306 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2019-02-28 10:53:14,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:53:14,306 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 406 [2019-02-28 10:53:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:14,307 INFO L225 Difference]: With dead ends: 416 [2019-02-28 10:53:14,307 INFO L226 Difference]: Without dead ends: 415 [2019-02-28 10:53:14,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 647 SyntacticMatches, 62 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32307 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=25328, Invalid=45694, Unknown=0, NotChecked=0, Total=71022 [2019-02-28 10:53:14,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-02-28 10:53:14,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2019-02-28 10:53:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-02-28 10:53:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2019-02-28 10:53:14,434 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 406 [2019-02-28 10:53:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:14,435 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2019-02-28 10:53:14,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-28 10:53:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2019-02-28 10:53:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-02-28 10:53:14,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:14,436 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1, 1] [2019-02-28 10:53:14,437 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:53:14,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:14,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1127215697, now seen corresponding path program 81 times [2019-02-28 10:53:14,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:14,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:14,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:14,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:14,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:17,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:17,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:17,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:17,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:17,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:17,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:17,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:53:17,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:53:18,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:53:18,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:18,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 1740 conjuncts, 262 conjunts are in the unsatisfiable core [2019-02-28 10:53:18,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:18,156 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:18,156 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:18,168 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:18,168 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:22,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:27,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:27,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-02-28 10:53:27,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:27,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-28 10:53:27,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-28 10:53:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13605, Invalid=21177, Unknown=0, NotChecked=0, Total=34782 [2019-02-28 10:53:27,124 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 168 states. [2019-02-28 10:53:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:33,647 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2019-02-28 10:53:33,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:53:33,647 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 411 [2019-02-28 10:53:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:33,649 INFO L225 Difference]: With dead ends: 421 [2019-02-28 10:53:33,649 INFO L226 Difference]: Without dead ends: 420 [2019-02-28 10:53:33,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 655 SyntacticMatches, 64 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32970 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=25618, Invalid=46474, Unknown=0, NotChecked=0, Total=72092 [2019-02-28 10:53:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-02-28 10:53:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2019-02-28 10:53:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-02-28 10:53:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2019-02-28 10:53:33,779 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 411 [2019-02-28 10:53:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:33,779 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2019-02-28 10:53:33,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-28 10:53:33,779 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2019-02-28 10:53:33,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-02-28 10:53:33,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:33,781 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1, 1] [2019-02-28 10:53:33,781 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:53:33,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:33,781 INFO L82 PathProgramCache]: Analyzing trace with hash -468747289, now seen corresponding path program 82 times [2019-02-28 10:53:33,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:33,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:53:33,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:33,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:37,563 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:37,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:37,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:37,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:37,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:37,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:37,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:37,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:37,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:53:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:37,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 263 conjunts are in the unsatisfiable core [2019-02-28 10:53:37,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:37,834 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:37,835 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,845 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:37,845 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:53:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:42,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:53:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:46,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:53:46,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-02-28 10:53:46,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:53:46,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-28 10:53:46,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-28 10:53:46,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13708, Invalid=21448, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:53:46,925 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 170 states. [2019-02-28 10:53:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:53:53,588 INFO L93 Difference]: Finished difference Result 426 states and 426 transitions. [2019-02-28 10:53:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:53:53,588 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 416 [2019-02-28 10:53:53,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:53:53,590 INFO L225 Difference]: With dead ends: 426 [2019-02-28 10:53:53,590 INFO L226 Difference]: Without dead ends: 425 [2019-02-28 10:53:53,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 663 SyntacticMatches, 66 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33635 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=25909, Invalid=47261, Unknown=0, NotChecked=0, Total=73170 [2019-02-28 10:53:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-02-28 10:53:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2019-02-28 10:53:53,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-02-28 10:53:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2019-02-28 10:53:53,725 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 416 [2019-02-28 10:53:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:53:53,726 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2019-02-28 10:53:53,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-28 10:53:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2019-02-28 10:53:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-02-28 10:53:53,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:53:53,728 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1, 1] [2019-02-28 10:53:53,729 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-02-28 10:53:53,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:53:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1099661295, now seen corresponding path program 83 times [2019-02-28 10:53:53,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:53:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:53,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:53:53,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:53:53,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:53:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:53:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:53:57,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:57,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:53:57,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:53:57,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:53:57,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:53:57,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:53:57,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:53:57,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:53:58,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-28 10:53:58,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:53:58,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 1782 conjuncts, 268 conjunts are in the unsatisfiable core [2019-02-28 10:53:58,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:53:58,764 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-28 10:53:58,765 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:53:58,774 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:53:58,774 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-28 10:54:03,518 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:54:03,519 INFO L322 TraceCheckSpWp]: Computing backward predicates...