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_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:01:06,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:01:06,055 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:01:06,067 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:01:06,067 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:01:06,068 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:01:06,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:01:06,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:01:06,073 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:01:06,074 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:01:06,075 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:01:06,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:01:06,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:01:06,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:01:06,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:01:06,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:01:06,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:01:06,083 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:01:06,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:01:06,087 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:01:06,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:01:06,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:01:06,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:01:06,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:01:06,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:01:06,094 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:01:06,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:01:06,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:01:06,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:01:06,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:01:06,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:01:06,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:01:06,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:01:06,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:01:06,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:01:06,101 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:01:06,102 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:01:06,118 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:01:06,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:01:06,119 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:01:06,120 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:01:06,121 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:01:06,121 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:01:06,121 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:01:06,121 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:01:06,121 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:01:06,122 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:01:06,122 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:01:06,122 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:01:06,122 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:01:06,123 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:01:06,123 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:01:06,124 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:01:06,124 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:01:06,124 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:01:06,124 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:01:06,125 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:01:06,126 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:01:06,126 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:01:06,127 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:01:06,127 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:01:06,127 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:01:06,127 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:01:06,127 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:01:06,128 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:01:06,128 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:01:06,128 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:01:06,128 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:01:06,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:01:06,129 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:01:06,129 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:01:06,129 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:01:06,130 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:01:06,130 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:01:06,130 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:01:06,130 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:01:06,130 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:01:06,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:01:06,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:01:06,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:01:06,207 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:01:06,207 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:01:06,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-01-11 11:01:06,208 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-11 11:01:06,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:01:06,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:01:06,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:01:06,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:01:06,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:01:06,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,303 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-11 11:01:06,303 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-11 11:01:06,303 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-11 11:01:06,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:01:06,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:01:06,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:01:06,321 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:01:06,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... [2019-01-11 11:01:06,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:01:06,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:01:06,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:01:06,347 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:01:06,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:01:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-11 11:01:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-11 11:01:06,421 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-11 11:01:06,421 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-11 11:01:06,790 INFO L278 CfgBuilder]: Using library mode [2019-01-11 11:01:06,790 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-11 11:01:06,791 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:01:06 BoogieIcfgContainer [2019-01-11 11:01:06,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:01:06,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:01:06,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:01:06,799 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:01:06,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:06" (1/2) ... [2019-01-11 11:01:06,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55341e94 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:01:06, skipping insertion in model container [2019-01-11 11:01:06,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:01:06" (2/2) ... [2019-01-11 11:01:06,810 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-11 11:01:06,828 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:01:06,838 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-11 11:01:06,857 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-11 11:01:06,896 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:01:06,897 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:01:06,897 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:01:06,897 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:01:06,897 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:01:06,898 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:01:06,900 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:01:06,900 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:01:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-11 11:01:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:01:06,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:06,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:01:06,930 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:06,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:06,937 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-11 11:01:06,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:06,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:06,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:07,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:07,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:01:07,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:07,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:01:07,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:01:07,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:01:07,190 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-11 11:01:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:07,278 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-11 11:01:07,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:01:07,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:01:07,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:07,292 INFO L225 Difference]: With dead ends: 20 [2019-01-11 11:01:07,292 INFO L226 Difference]: Without dead ends: 10 [2019-01-11 11:01:07,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:01:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-11 11:01:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-11 11:01:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 11:01:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-11 11:01:07,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-11 11:01:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:07,331 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-11 11:01:07,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:01:07,332 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-11 11:01:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:01:07,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:07,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:01:07,333 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:07,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-11 11:01:07,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:07,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:07,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:07,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:01:07,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:07,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:01:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:01:07,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:01:07,501 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-11 11:01:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:07,707 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-11 11:01:07,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:01:07,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-11 11:01:07,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:07,710 INFO L225 Difference]: With dead ends: 17 [2019-01-11 11:01:07,710 INFO L226 Difference]: Without dead ends: 16 [2019-01-11 11:01:07,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:01:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-11 11:01:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-11 11:01:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:01:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-11 11:01:07,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-11 11:01:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:07,727 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-11 11:01:07,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:01:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-11 11:01:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:01:07,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:07,728 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 11:01:07,729 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:07,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-11 11:01:07,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:07,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:07,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:07,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:07,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:01:07,795 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:07,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:01:07,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:01:07,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:01:07,797 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-11 11:01:07,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:07,815 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-11 11:01:07,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:01:07,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-11 11:01:07,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:07,817 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:01:07,817 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 11:01:07,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:01:07,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 11:01:07,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 11:01:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:01:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-11 11:01:07,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-11 11:01:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:07,822 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-11 11:01:07,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:01:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-11 11:01:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:01:07,823 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:07,823 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-11 11:01:07,823 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:07,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:07,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-11 11:01:07,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:07,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:07,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:08,061 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:01:08,063 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-11 11:01:08,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:01:08,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:01:08,235 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:01:08,237 INFO L272 AbstractInterpreter]: Visited 7 different actions 25 times. Merged at 6 different actions 18 times. Never widened. Performed 246 root evaluator evaluations with a maximum evaluation depth of 3. Performed 246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:01:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:08,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:01:08,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:08,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:08,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:08,467 INFO L478 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-01-11 11:01:08,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:08,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:08,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:01:08,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:08,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:01:08,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:01:08,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:01:08,798 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-01-11 11:01:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:09,028 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-11 11:01:09,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:01:09,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-11 11:01:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:09,029 INFO L225 Difference]: With dead ends: 20 [2019-01-11 11:01:09,029 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 11:01:09,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:01:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 11:01:09,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-11 11:01:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:01:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-11 11:01:09,035 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-11 11:01:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:09,035 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-11 11:01:09,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:01:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-11 11:01:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-11 11:01:09,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:09,036 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-11 11:01:09,037 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:09,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-01-11 11:01:09,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:09,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:09,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:09,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:09,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:09,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:09,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:09,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:01:09,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:09,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:09,306 INFO L478 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-01-11 11:01:09,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:09,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:09,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:09,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:01:09,541 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:09,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:01:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:01:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:01:09,543 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-01-11 11:01:09,887 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2019-01-11 11:01:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:10,022 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-11 11:01:10,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:01:10,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-11 11:01:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:10,025 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:01:10,025 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:01:10,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:01:10,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:01:10,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-11 11:01:10,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:01:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-11 11:01:10,031 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-11 11:01:10,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:10,032 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-11 11:01:10,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:01:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-11 11:01:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 11:01:10,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:10,033 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-11 11:01:10,033 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:10,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:10,034 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-01-11 11:01:10,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:10,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:10,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:10,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:10,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:10,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:10,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:10,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:10,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:10,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:10,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:10,221 INFO L478 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-01-11 11:01:10,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:10,363 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:10,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:01:10,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:10,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:01:10,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:01:10,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:01:10,555 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-11 11:01:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:10,749 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-11 11:01:10,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:01:10,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-11 11:01:10,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:10,754 INFO L225 Difference]: With dead ends: 30 [2019-01-11 11:01:10,754 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 11:01:10,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:01:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 11:01:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-11 11:01:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:01:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-11 11:01:10,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-11 11:01:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:10,761 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-11 11:01:10,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:01:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-11 11:01:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-11 11:01:10,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:10,762 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-11 11:01:10,762 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-01-11 11:01:10,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:10,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:10,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:10,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:10,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:10,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:11,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:11,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:11,025 INFO L478 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-01-11 11:01:11,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:11,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:11,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:11,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:11,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 11:01:11,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:11,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:01:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:01:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:01:11,407 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-01-11 11:01:11,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:11,767 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-11 11:01:11,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:01:11,772 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-11 11:01:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:11,773 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:01:11,773 INFO L226 Difference]: Without dead ends: 34 [2019-01-11 11:01:11,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:01:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-11 11:01:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-11 11:01:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:01:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-11 11:01:11,780 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-11 11:01:11,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:11,781 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-11 11:01:11,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:01:11,781 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-11 11:01:11,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 11:01:11,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:11,782 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-11 11:01:11,782 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-01-11 11:01:11,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:11,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:11,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:11,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:11,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:11,957 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:11,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:11,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:11,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:11,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:11,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:11,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:11,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:11,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:12,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 11:01:12,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:12,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:12,018 INFO L478 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-01-11 11:01:12,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:12,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:12,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:12,175 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:12,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:12,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:12,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-11 11:01:12,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:12,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 11:01:12,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 11:01:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:01:12,508 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-11 11:01:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:12,993 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-11 11:01:12,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:01:12,997 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-11 11:01:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:12,998 INFO L225 Difference]: With dead ends: 40 [2019-01-11 11:01:12,998 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 11:01:12,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:01:12,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 11:01:13,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-11 11:01:13,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:01:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-11 11:01:13,005 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-11 11:01:13,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:13,005 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-11 11:01:13,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 11:01:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-11 11:01:13,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-11 11:01:13,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:13,006 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-11 11:01:13,007 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:13,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:13,007 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-01-11 11:01:13,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:13,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:13,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:13,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:13,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:13,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:13,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:13,561 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:13,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:13,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:13,572 INFO L478 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-01-11 11:01:13,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:13,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-11 11:01:13,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:13,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 11:01:13,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 11:01:13,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:01:13,937 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-01-11 11:01:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:14,520 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-11 11:01:14,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:01:14,520 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-11 11:01:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:14,521 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:01:14,522 INFO L226 Difference]: Without dead ends: 44 [2019-01-11 11:01:14,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:01:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-11 11:01:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-11 11:01:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:01:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-11 11:01:14,529 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-11 11:01:14,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:14,530 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-11 11:01:14,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 11:01:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-11 11:01:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 11:01:14,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:14,531 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-11 11:01:14,531 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-01-11 11:01:14,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:14,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:14,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:14,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:14,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:14,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:14,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:14,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:14,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:14,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:14,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:14,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:14,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:14,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:14,822 INFO L478 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-01-11 11:01:14,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:14,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:14,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:15,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:15,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:15,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-11 11:01:15,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:15,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 11:01:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 11:01:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:01:15,406 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-01-11 11:01:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:15,720 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-11 11:01:15,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:01:15,721 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-01-11 11:01:15,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:15,722 INFO L225 Difference]: With dead ends: 50 [2019-01-11 11:01:15,722 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 11:01:15,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 11:01:15,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-11 11:01:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 11:01:15,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-11 11:01:15,731 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-11 11:01:15,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:15,732 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-11 11:01:15,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 11:01:15,732 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-11 11:01:15,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-11 11:01:15,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:15,733 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-11 11:01:15,734 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:15,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:15,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-01-11 11:01:15,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:15,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:15,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:16,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:16,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:16,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:16,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:16,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:16,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:16,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 11:01:16,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:16,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:16,431 INFO L478 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-01-11 11:01:16,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:16,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:16,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:16,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:16,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:16,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-11 11:01:16,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:16,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 11:01:16,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 11:01:16,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:01:16,881 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-01-11 11:01:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:17,221 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-11 11:01:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:01:17,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-11 11:01:17,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:17,223 INFO L225 Difference]: With dead ends: 55 [2019-01-11 11:01:17,223 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 11:01:17,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 11:01:17,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 11:01:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-11 11:01:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:01:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-11 11:01:17,231 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-11 11:01:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:17,232 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-11 11:01:17,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 11:01:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-11 11:01:17,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 11:01:17,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:17,233 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-11 11:01:17,233 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:17,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-01-11 11:01:17,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:17,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:17,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:17,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:17,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:17,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:17,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:17,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:17,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:17,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:17,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:17,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:17,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:17,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:17,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:17,794 INFO L478 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-01-11 11:01:17,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:17,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:17,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:18,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:18,285 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:18,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:18,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-11 11:01:18,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:18,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 11:01:18,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 11:01:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:01:18,308 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-01-11 11:01:18,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:18,716 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-11 11:01:18,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:01:18,717 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-01-11 11:01:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:18,717 INFO L225 Difference]: With dead ends: 60 [2019-01-11 11:01:18,718 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 11:01:18,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 11:01:18,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 11:01:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-01-11 11:01:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 11:01:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-11 11:01:18,729 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-11 11:01:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:18,729 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-11 11:01:18,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 11:01:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-11 11:01:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 11:01:18,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:18,731 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-11 11:01:18,731 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-01-11 11:01:18,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:18,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:18,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:19,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:19,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:19,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:19,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:19,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:19,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:19,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:19,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:19,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:19,470 INFO L478 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-01-11 11:01:19,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:19,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:19,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:19,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:19,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:19,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-11 11:01:19,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:19,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 11:01:19,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 11:01:19,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:19,978 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-01-11 11:01:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:20,389 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-11 11:01:20,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:01:20,389 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-11 11:01:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:20,390 INFO L225 Difference]: With dead ends: 65 [2019-01-11 11:01:20,390 INFO L226 Difference]: Without dead ends: 64 [2019-01-11 11:01:20,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:20,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-11 11:01:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-11 11:01:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:01:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-11 11:01:20,402 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-11 11:01:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:20,403 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-11 11:01:20,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 11:01:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-11 11:01:20,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 11:01:20,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:20,404 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-11 11:01:20,404 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-01-11 11:01:20,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:20,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:20,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:20,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:20,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:20,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:20,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:20,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:20,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:20,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:20,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:20,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:20,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-11 11:01:20,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:20,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:20,773 INFO L478 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-01-11 11:01:20,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:20,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:20,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:20,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:21,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:21,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-11 11:01:21,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:21,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 11:01:21,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 11:01:21,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:01:21,277 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-01-11 11:01:21,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:21,798 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-11 11:01:21,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:01:21,799 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-01-11 11:01:21,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:21,799 INFO L225 Difference]: With dead ends: 70 [2019-01-11 11:01:21,800 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 11:01:21,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 11:01:21,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 11:01:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-11 11:01:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 11:01:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-11 11:01:21,810 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-11 11:01:21,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:21,810 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-11 11:01:21,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 11:01:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-11 11:01:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-11 11:01:21,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:21,812 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-11 11:01:21,812 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:21,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:21,812 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-01-11 11:01:21,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:21,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:21,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:21,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:22,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:22,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:22,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:22,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:22,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:22,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:22,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:22,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:22,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:22,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:22,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:22,315 INFO L478 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-01-11 11:01:22,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:22,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:22,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:22,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:23,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:23,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-11 11:01:23,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:23,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 11:01:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 11:01:23,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:01:23,081 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-01-11 11:01:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:23,812 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-11 11:01:23,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 11:01:23,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-01-11 11:01:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:23,813 INFO L225 Difference]: With dead ends: 75 [2019-01-11 11:01:23,813 INFO L226 Difference]: Without dead ends: 74 [2019-01-11 11:01:23,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 11:01:23,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-11 11:01:23,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-11 11:01:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 11:01:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-11 11:01:23,828 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-11 11:01:23,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:23,829 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-11 11:01:23,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 11:01:23,829 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-11 11:01:23,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 11:01:23,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:23,830 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-11 11:01:23,830 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:23,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-01-11 11:01:23,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:23,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:23,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:23,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:24,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:24,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:24,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:24,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:24,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:24,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:24,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:24,140 INFO L478 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-01-11 11:01:24,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:24,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:24,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:24,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:24,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:24,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-11 11:01:24,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:24,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 11:01:24,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 11:01:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:01:24,880 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-01-11 11:01:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:25,471 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-11 11:01:25,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 11:01:25,471 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-01-11 11:01:25,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:25,472 INFO L225 Difference]: With dead ends: 80 [2019-01-11 11:01:25,473 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 11:01:25,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:01:25,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 11:01:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-11 11:01:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-11 11:01:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-11 11:01:25,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-11 11:01:25,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:25,486 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-11 11:01:25,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 11:01:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-11 11:01:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-11 11:01:25,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:25,488 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-11 11:01:25,488 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-01-11 11:01:25,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:25,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:25,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:25,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:25,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:25,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:25,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:25,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:25,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:25,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:25,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:25,827 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:25,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 11:01:25,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:25,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:25,955 INFO L478 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-01-11 11:01:25,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:25,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:25,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:26,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:26,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:26,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-11 11:01:26,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:26,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 11:01:26,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 11:01:26,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:26,625 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-01-11 11:01:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:27,137 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-11 11:01:27,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:01:27,137 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-01-11 11:01:27,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:27,138 INFO L225 Difference]: With dead ends: 85 [2019-01-11 11:01:27,139 INFO L226 Difference]: Without dead ends: 84 [2019-01-11 11:01:27,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 11:01:27,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-11 11:01:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-11 11:01:27,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 11:01:27,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-11 11:01:27,152 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-11 11:01:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:27,153 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-11 11:01:27,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 11:01:27,153 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-11 11:01:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 11:01:27,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:27,154 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-11 11:01:27,154 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:27,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:27,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-01-11 11:01:27,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:27,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:27,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:27,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:27,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:27,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:27,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:27,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:27,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:27,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:27,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:27,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:27,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:27,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:27,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:27,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:27,499 INFO L478 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-01-11 11:01:27,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:27,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:27,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:28,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:29,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-11 11:01:29,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:29,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 11:01:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 11:01:29,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:01:29,147 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-01-11 11:01:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:29,742 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-11 11:01:29,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:01:29,743 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-01-11 11:01:29,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:29,743 INFO L225 Difference]: With dead ends: 90 [2019-01-11 11:01:29,743 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:01:29,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:01:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:01:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-11 11:01:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-11 11:01:29,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-11 11:01:29,757 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-11 11:01:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:29,758 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-11 11:01:29,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 11:01:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-11 11:01:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-11 11:01:29,759 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:29,759 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-11 11:01:29,759 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-01-11 11:01:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:29,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:29,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:29,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:29,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:30,214 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:30,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:30,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:30,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:30,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:30,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:30,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:30,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:30,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:30,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:30,287 INFO L478 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-01-11 11:01:30,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:30,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:31,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:31,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-11 11:01:31,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:31,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 11:01:31,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 11:01:31,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:01:31,019 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-01-11 11:01:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:31,588 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-11 11:01:31,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 11:01:31,589 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-01-11 11:01:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:31,589 INFO L225 Difference]: With dead ends: 95 [2019-01-11 11:01:31,589 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 11:01:31,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:01:31,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 11:01:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-11 11:01:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 11:01:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-11 11:01:31,601 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-11 11:01:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:31,602 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-11 11:01:31,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 11:01:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-11 11:01:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 11:01:31,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:31,602 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-11 11:01:31,603 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:31,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:31,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-01-11 11:01:31,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:31,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:31,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:31,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:31,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:32,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:32,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:32,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:32,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:32,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:32,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:32,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:32,022 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:32,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 11:01:32,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:32,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:32,108 INFO L478 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-01-11 11:01:32,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:32,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:32,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:32,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:33,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:33,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-11 11:01:33,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:33,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 11:01:33,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 11:01:33,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:01:33,296 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-01-11 11:01:33,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:33,926 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-11 11:01:33,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 11:01:33,927 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-01-11 11:01:33,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:33,927 INFO L225 Difference]: With dead ends: 100 [2019-01-11 11:01:33,928 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 11:01:33,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:01:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 11:01:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-11 11:01:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 11:01:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-11 11:01:33,943 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-11 11:01:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:33,943 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-11 11:01:33,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 11:01:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-11 11:01:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-11 11:01:33,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:33,944 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-11 11:01:33,945 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-01-11 11:01:33,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:33,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:33,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:33,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:33,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:34,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:34,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:34,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:34,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:34,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:34,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:34,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:34,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:34,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:34,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:34,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:34,459 INFO L478 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-01-11 11:01:34,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:34,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:34,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:34,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:35,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:35,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-11 11:01:35,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:35,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 11:01:35,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 11:01:35,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:01:35,450 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-01-11 11:01:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:36,137 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-11 11:01:36,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 11:01:36,137 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-01-11 11:01:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:36,139 INFO L225 Difference]: With dead ends: 105 [2019-01-11 11:01:36,139 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 11:01:36,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 11:01:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 11:01:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-01-11 11:01:36,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:01:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-11 11:01:36,152 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-11 11:01:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:36,152 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-11 11:01:36,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 11:01:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-11 11:01:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 11:01:36,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:36,153 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-11 11:01:36,153 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-01-11 11:01:36,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:36,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:36,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:36,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:36,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:36,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:36,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:36,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:36,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:36,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:36,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:36,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:36,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:36,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:36,640 INFO L478 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-01-11 11:01:36,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:36,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:36,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:37,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:37,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:37,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-11 11:01:37,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:37,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 11:01:37,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 11:01:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 11:01:37,718 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-01-11 11:01:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:38,528 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-11 11:01:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 11:01:38,531 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-01-11 11:01:38,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:38,531 INFO L225 Difference]: With dead ends: 110 [2019-01-11 11:01:38,532 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 11:01:38,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:01:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 11:01:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-11 11:01:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 11:01:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-11 11:01:38,543 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-11 11:01:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:38,543 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-11 11:01:38,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 11:01:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-11 11:01:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-11 11:01:38,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:38,544 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-11 11:01:38,544 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:38,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:38,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-01-11 11:01:38,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:38,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:38,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:38,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:38,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:39,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:39,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:39,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:39,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:39,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:39,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:39,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:39,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:39,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-11 11:01:39,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:39,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:39,641 INFO L478 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-01-11 11:01:39,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:39,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:39,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:40,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-11 11:01:40,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:40,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 11:01:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 11:01:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 11:01:40,950 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-01-11 11:01:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:41,738 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-11 11:01:41,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 11:01:41,738 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-01-11 11:01:41,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:41,739 INFO L225 Difference]: With dead ends: 115 [2019-01-11 11:01:41,739 INFO L226 Difference]: Without dead ends: 114 [2019-01-11 11:01:41,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 11:01:41,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-11 11:01:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-11 11:01:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 11:01:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-11 11:01:41,756 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-11 11:01:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:41,757 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-11 11:01:41,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 11:01:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-11 11:01:41,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 11:01:41,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:41,758 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-11 11:01:41,758 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:41,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:41,758 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-01-11 11:01:41,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:41,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:41,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:41,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:41,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:42,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:42,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:42,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:42,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:42,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:42,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:42,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:42,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:42,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:42,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:42,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:42,467 INFO L478 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-01-11 11:01:42,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:42,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:42,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:42,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:43,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-11 11:01:43,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:43,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 11:01:43,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 11:01:43,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:01:43,912 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-01-11 11:01:44,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:44,769 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-11 11:01:44,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:01:44,770 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-01-11 11:01:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:44,771 INFO L225 Difference]: With dead ends: 120 [2019-01-11 11:01:44,771 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 11:01:44,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:01:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 11:01:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-01-11 11:01:44,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 11:01:44,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-11 11:01:44,790 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-11 11:01:44,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:44,790 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-11 11:01:44,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 11:01:44,790 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-11 11:01:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-11 11:01:44,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:44,791 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-11 11:01:44,791 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-01-11 11:01:44,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:44,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:44,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:44,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:44,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:45,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:45,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:45,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:45,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:45,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:45,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:45,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:45,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:45,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:45,852 INFO L478 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-01-11 11:01:45,853 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:45,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:45,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:46,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:46,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:47,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:47,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-11 11:01:47,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:47,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 11:01:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 11:01:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:01:47,092 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-01-11 11:01:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:48,122 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-01-11 11:01:48,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:01:48,123 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-01-11 11:01:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:48,123 INFO L225 Difference]: With dead ends: 125 [2019-01-11 11:01:48,123 INFO L226 Difference]: Without dead ends: 124 [2019-01-11 11:01:48,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:01:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-11 11:01:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-01-11 11:01:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-11 11:01:48,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-11 11:01:48,137 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-11 11:01:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:48,138 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-11 11:01:48,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 11:01:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-11 11:01:48,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-11 11:01:48,138 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:48,138 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-11 11:01:48,139 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:48,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:48,139 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-01-11 11:01:48,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:48,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:48,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:48,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:48,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:48,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:48,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:48,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:48,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:48,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:48,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:48,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 11:01:48,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:48,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:48,835 INFO L478 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-01-11 11:01:48,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:48,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:48,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:49,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:50,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:50,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-11 11:01:50,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:50,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 11:01:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 11:01:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 11:01:50,124 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-01-11 11:01:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:51,071 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-11 11:01:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 11:01:51,072 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-01-11 11:01:51,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:51,073 INFO L225 Difference]: With dead ends: 130 [2019-01-11 11:01:51,073 INFO L226 Difference]: Without dead ends: 129 [2019-01-11 11:01:51,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:01:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-11 11:01:51,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-01-11 11:01:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-11 11:01:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-11 11:01:51,091 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-11 11:01:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:51,092 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-11 11:01:51,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 11:01:51,092 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-11 11:01:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-11 11:01:51,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:51,093 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-11 11:01:51,093 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:51,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:51,093 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-01-11 11:01:51,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:51,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:51,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:51,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:51,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:51,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:51,604 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:51,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:51,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:51,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:51,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:51,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:51,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:51,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:51,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:51,705 INFO L478 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-01-11 11:01:51,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:51,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:51,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:52,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:53,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:53,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:53,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-11 11:01:53,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:53,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 11:01:53,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 11:01:53,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:01:53,196 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-01-11 11:01:54,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:54,309 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-11 11:01:54,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 11:01:54,309 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-01-11 11:01:54,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:54,310 INFO L225 Difference]: With dead ends: 135 [2019-01-11 11:01:54,310 INFO L226 Difference]: Without dead ends: 134 [2019-01-11 11:01:54,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 11:01:54,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-11 11:01:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-01-11 11:01:54,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-11 11:01:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-11 11:01:54,333 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-11 11:01:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:54,333 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-11 11:01:54,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 11:01:54,333 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-11 11:01:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-11 11:01:54,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:54,334 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-11 11:01:54,335 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-01-11 11:01:54,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:54,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:54,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:54,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:54,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:54,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:54,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:54,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:54,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:54,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:54,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:55,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:55,034 INFO L478 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-01-11 11:01:55,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:55,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:55,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:55,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:56,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:56,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-11 11:01:56,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:56,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-11 11:01:56,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-11 11:01:56,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-01-11 11:01:56,537 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-01-11 11:01:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:57,606 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-11 11:01:57,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 11:01:57,606 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-01-11 11:01:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:57,607 INFO L225 Difference]: With dead ends: 140 [2019-01-11 11:01:57,607 INFO L226 Difference]: Without dead ends: 139 [2019-01-11 11:01:57,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:01:57,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-11 11:01:57,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-01-11 11:01:57,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-11 11:01:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-11 11:01:57,627 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-11 11:01:57,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:57,627 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-11 11:01:57,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-11 11:01:57,628 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-11 11:01:57,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-11 11:01:57,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:57,629 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-11 11:01:57,629 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:57,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:57,629 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-01-11 11:01:57,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:57,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:57,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:57,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:57,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:58,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:58,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:58,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:58,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:58,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:58,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:58,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:58,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:58,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 11:01:58,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:58,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:58,376 INFO L478 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-01-11 11:01:58,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:58,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:58,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:00,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:01,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:01,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-11 11:02:01,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:01,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 11:02:01,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 11:02:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:02:01,165 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-01-11 11:02:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:02,247 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-01-11 11:02:02,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:02:02,248 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-01-11 11:02:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:02,249 INFO L225 Difference]: With dead ends: 145 [2019-01-11 11:02:02,249 INFO L226 Difference]: Without dead ends: 144 [2019-01-11 11:02:02,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 11:02:02,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-11 11:02:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-01-11 11:02:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-11 11:02:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-11 11:02:02,270 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-11 11:02:02,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:02,270 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-11 11:02:02,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 11:02:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-11 11:02:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-11 11:02:02,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:02,271 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-11 11:02:02,272 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:02,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:02,272 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-01-11 11:02:02,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:02,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:02,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:02,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:03,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:03,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:03,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:03,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:03,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:03,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:03,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:03,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:03,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:03,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:03,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:03,380 INFO L478 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-01-11 11:02:03,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:03,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:03,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:04,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:05,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:05,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-11 11:02:05,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:05,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-11 11:02:05,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-11 11:02:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 11:02:05,602 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-01-11 11:02:06,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:06,780 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-11 11:02:06,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:02:06,780 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-01-11 11:02:06,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:06,781 INFO L225 Difference]: With dead ends: 150 [2019-01-11 11:02:06,781 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 11:02:06,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:02:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 11:02:06,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-11 11:02:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-11 11:02:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-11 11:02:06,799 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-11 11:02:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:06,800 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-11 11:02:06,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-11 11:02:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-11 11:02:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-11 11:02:06,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:06,801 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-11 11:02:06,801 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:06,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:06,802 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-01-11 11:02:06,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:06,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:06,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:06,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:06,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:07,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:07,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:07,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:07,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:07,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:07,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:07,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:07,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:07,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:07,767 INFO L478 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-01-11 11:02:07,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:07,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:07,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:08,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:08,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:09,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-11 11:02:09,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:09,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-11 11:02:09,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-11 11:02:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:02:09,937 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-01-11 11:02:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:11,127 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-11 11:02:11,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 11:02:11,127 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-01-11 11:02:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:11,128 INFO L225 Difference]: With dead ends: 155 [2019-01-11 11:02:11,128 INFO L226 Difference]: Without dead ends: 154 [2019-01-11 11:02:11,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:02:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-11 11:02:11,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-01-11 11:02:11,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-11 11:02:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-11 11:02:11,149 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-11 11:02:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:11,150 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-11 11:02:11,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-11 11:02:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-11 11:02:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-11 11:02:11,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:11,150 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-11 11:02:11,151 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-01-11 11:02:11,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:11,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:11,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:11,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:11,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:11,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:11,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:11,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:11,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:11,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:11,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:11,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:11,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-11 11:02:11,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:11,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:11,948 INFO L478 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-01-11 11:02:11,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:11,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:11,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:12,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:14,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:14,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-11 11:02:14,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:14,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 11:02:14,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 11:02:14,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:02:14,445 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-01-11 11:02:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:15,680 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-01-11 11:02:15,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 11:02:15,680 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-01-11 11:02:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:15,681 INFO L225 Difference]: With dead ends: 160 [2019-01-11 11:02:15,681 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 11:02:15,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:02:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 11:02:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-01-11 11:02:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-11 11:02:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-11 11:02:15,708 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-11 11:02:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:15,708 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-11 11:02:15,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 11:02:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-11 11:02:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-11 11:02:15,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:15,709 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-11 11:02:15,710 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:15,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-01-11 11:02:15,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:15,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:15,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:16,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:16,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:16,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:16,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:16,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:16,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:16,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:16,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:16,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:16,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:16,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:16,640 INFO L478 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-01-11 11:02:16,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:16,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:16,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:17,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:19,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:19,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-11 11:02:19,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:19,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-11 11:02:19,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-11 11:02:19,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:02:19,106 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-01-11 11:02:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:20,454 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-11 11:02:20,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:02:20,455 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-01-11 11:02:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:20,456 INFO L225 Difference]: With dead ends: 165 [2019-01-11 11:02:20,456 INFO L226 Difference]: Without dead ends: 164 [2019-01-11 11:02:20,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:02:20,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-11 11:02:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-11 11:02:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-11 11:02:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-11 11:02:20,484 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-01-11 11:02:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:20,485 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-11 11:02:20,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-11 11:02:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-11 11:02:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-11 11:02:20,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:20,486 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-01-11 11:02:20,486 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:20,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-01-11 11:02:20,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:20,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:20,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:21,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:21,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:21,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:21,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:21,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:21,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:21,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:21,262 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:21,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:21,363 INFO L478 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-01-11 11:02:21,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:21,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:21,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:22,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:23,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:23,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-11 11:02:23,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:23,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-11 11:02:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-11 11:02:23,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:02:23,604 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-01-11 11:02:24,362 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-11 11:02:25,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:25,584 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-01-11 11:02:25,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 11:02:25,584 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-01-11 11:02:25,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:25,586 INFO L225 Difference]: With dead ends: 170 [2019-01-11 11:02:25,586 INFO L226 Difference]: Without dead ends: 169 [2019-01-11 11:02:25,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:02:25,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-11 11:02:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-01-11 11:02:25,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-11 11:02:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-11 11:02:25,615 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-01-11 11:02:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:25,616 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-11 11:02:25,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-11 11:02:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-11 11:02:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-11 11:02:25,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:25,617 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-01-11 11:02:25,617 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:25,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:25,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-01-11 11:02:25,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:25,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:25,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:25,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:26,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-01-11 11:02:26,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:26,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:26,553 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:26,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:26,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:26,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:26,562 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:26,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:26,742 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-11 11:02:26,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:26,749 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:26,765 INFO L478 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-01-11 11:02:26,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:26,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:26,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:27,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:29,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:29,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-11 11:02:29,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:29,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 11:02:29,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 11:02:29,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:02:29,395 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-01-11 11:02:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:30,875 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-11 11:02:30,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:02:30,876 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-01-11 11:02:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:30,876 INFO L225 Difference]: With dead ends: 175 [2019-01-11 11:02:30,877 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 11:02:30,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-01-11 11:02:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 11:02:30,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-01-11 11:02:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 11:02:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-01-11 11:02:30,911 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-01-11 11:02:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:30,912 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-01-11 11:02:30,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 11:02:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-01-11 11:02:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-11 11:02:30,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:30,913 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-01-11 11:02:30,913 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-01-11 11:02:30,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:30,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:30,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:32,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:32,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:32,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:32,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:32,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:32,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:32,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:32,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:32,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:32,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:32,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:32,198 INFO L478 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-01-11 11:02:32,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:32,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:32,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:33,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:34,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:34,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-11 11:02:34,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:34,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-11 11:02:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-11 11:02:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:02:34,938 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-01-11 11:02:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:36,506 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-11 11:02:36,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 11:02:36,506 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-01-11 11:02:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:36,507 INFO L225 Difference]: With dead ends: 180 [2019-01-11 11:02:36,507 INFO L226 Difference]: Without dead ends: 179 [2019-01-11 11:02:36,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:02:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-11 11:02:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-01-11 11:02:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-11 11:02:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-11 11:02:36,533 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-01-11 11:02:36,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:36,533 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-11 11:02:36,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-11 11:02:36,533 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-11 11:02:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-11 11:02:36,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:36,534 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-01-11 11:02:36,535 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-01-11 11:02:36,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:36,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:36,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:36,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:37,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:37,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:37,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:37,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:37,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:37,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:37,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:37,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:37,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:37,905 INFO L478 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-01-11 11:02:37,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:37,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:37,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:38,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:40,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:40,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-11 11:02:40,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:40,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 11:02:40,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 11:02:40,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:02:40,792 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-01-11 11:02:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:42,334 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-01-11 11:02:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:02:42,334 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-01-11 11:02:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:42,335 INFO L225 Difference]: With dead ends: 185 [2019-01-11 11:02:42,336 INFO L226 Difference]: Without dead ends: 184 [2019-01-11 11:02:42,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:02:42,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-11 11:02:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-01-11 11:02:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-11 11:02:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-11 11:02:42,367 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-01-11 11:02:42,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:42,367 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-11 11:02:42,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 11:02:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-11 11:02:42,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-11 11:02:42,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:42,369 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-01-11 11:02:42,369 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:42,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:42,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-01-11 11:02:42,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:42,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:42,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:42,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:42,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:43,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:43,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:43,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:43,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:43,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:43,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:43,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:43,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:43,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-11 11:02:43,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:43,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:43,679 INFO L478 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-01-11 11:02:43,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:43,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:43,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:45,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:46,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:46,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:46,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-11 11:02:46,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:46,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 11:02:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 11:02:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 11:02:46,745 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-01-11 11:02:48,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:48,324 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-01-11 11:02:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 11:02:48,324 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-01-11 11:02:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:48,325 INFO L225 Difference]: With dead ends: 190 [2019-01-11 11:02:48,326 INFO L226 Difference]: Without dead ends: 189 [2019-01-11 11:02:48,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:02:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-11 11:02:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-01-11 11:02:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-11 11:02:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-01-11 11:02:48,364 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-01-11 11:02:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:48,364 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-01-11 11:02:48,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 11:02:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-01-11 11:02:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-11 11:02:48,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:48,365 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-01-11 11:02:48,365 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-01-11 11:02:48,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:48,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:48,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:48,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:49,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:49,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:49,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:49,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:49,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:49,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:49,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:49,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:49,434 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:49,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:49,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:49,480 INFO L478 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-01-11 11:02:49,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:49,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:49,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:51,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:51,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:53,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:53,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-11 11:02:53,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:53,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-11 11:02:53,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-11 11:02:53,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:02:53,091 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-01-11 11:02:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:54,819 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-11 11:02:54,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 11:02:54,819 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-01-11 11:02:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:54,820 INFO L225 Difference]: With dead ends: 195 [2019-01-11 11:02:54,820 INFO L226 Difference]: Without dead ends: 194 [2019-01-11 11:02:54,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-01-11 11:02:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-11 11:02:54,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-01-11 11:02:54,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-11 11:02:54,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-01-11 11:02:54,854 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-01-11 11:02:54,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:54,854 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-01-11 11:02:54,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-11 11:02:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-01-11 11:02:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-11 11:02:54,856 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:54,856 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-01-11 11:02:54,856 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:54,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-01-11 11:02:54,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:54,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:54,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:55,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:55,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:55,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:55,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:55,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:55,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:55,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:55,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:55,873 INFO L478 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-01-11 11:02:55,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:55,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:55,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:56,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:58,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:58,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-11 11:02:58,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:58,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 11:02:58,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 11:02:58,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 11:02:58,903 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-01-11 11:02:59,459 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-11 11:03:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:01,201 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-01-11 11:03:01,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 11:03:01,202 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-01-11 11:03:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:01,202 INFO L225 Difference]: With dead ends: 200 [2019-01-11 11:03:01,203 INFO L226 Difference]: Without dead ends: 199 [2019-01-11 11:03:01,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:03:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-11 11:03:01,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-01-11 11:03:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-11 11:03:01,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-11 11:03:01,231 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-01-11 11:03:01,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:01,231 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-11 11:03:01,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 11:03:01,232 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-11 11:03:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-11 11:03:01,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:01,232 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-01-11 11:03:01,232 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:01,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:01,233 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-01-11 11:03:01,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:01,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:01,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:01,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:01,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:02,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:02,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:02,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:02,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:02,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:02,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:02,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:02,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:02,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:02,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-11 11:03:02,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:02,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:02,971 INFO L478 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-01-11 11:03:02,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:02,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:02,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:04,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:06,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:06,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:06,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-11 11:03:06,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:06,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 11:03:06,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 11:03:06,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:03:06,311 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-01-11 11:03:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:08,112 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-01-11 11:03:08,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 11:03:08,112 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-01-11 11:03:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:08,113 INFO L225 Difference]: With dead ends: 205 [2019-01-11 11:03:08,113 INFO L226 Difference]: Without dead ends: 204 [2019-01-11 11:03:08,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:03:08,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-11 11:03:08,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-01-11 11:03:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-11 11:03:08,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-11 11:03:08,142 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-01-11 11:03:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:08,143 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-11 11:03:08,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 11:03:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-11 11:03:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-11 11:03:08,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:08,144 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-01-11 11:03:08,144 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-01-11 11:03:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:08,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:08,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:09,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:09,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:09,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:09,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:09,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:09,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:09,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:09,524 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:09,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:09,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:09,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:09,660 INFO L478 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-01-11 11:03:09,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:09,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:09,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:11,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:11,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:13,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:13,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-11 11:03:13,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:13,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-11 11:03:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-11 11:03:13,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 11:03:13,134 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-01-11 11:03:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:14,979 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-11 11:03:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:03:14,979 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-01-11 11:03:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:14,980 INFO L225 Difference]: With dead ends: 210 [2019-01-11 11:03:14,980 INFO L226 Difference]: Without dead ends: 209 [2019-01-11 11:03:14,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:03:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-11 11:03:15,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-01-11 11:03:15,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-11 11:03:15,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-11 11:03:15,014 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-01-11 11:03:15,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:15,014 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-11 11:03:15,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-11 11:03:15,014 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-11 11:03:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-11 11:03:15,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:15,015 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-01-11 11:03:15,015 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:15,016 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-01-11 11:03:15,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:15,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:15,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:16,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:16,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:16,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:16,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:16,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:16,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:16,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:16,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:16,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:16,304 INFO L478 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-01-11 11:03:16,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:16,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:16,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:17,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:19,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:19,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-11 11:03:19,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:19,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 11:03:19,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 11:03:19,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:03:19,748 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-01-11 11:03:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:21,959 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-11 11:03:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 11:03:21,960 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-01-11 11:03:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:21,961 INFO L225 Difference]: With dead ends: 215 [2019-01-11 11:03:21,961 INFO L226 Difference]: Without dead ends: 214 [2019-01-11 11:03:21,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:03:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-11 11:03:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-01-11 11:03:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-11 11:03:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-11 11:03:21,997 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-01-11 11:03:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:21,997 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-11 11:03:21,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 11:03:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-11 11:03:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-11 11:03:21,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:21,998 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-01-11 11:03:21,998 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-01-11 11:03:21,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:21,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:21,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:22,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:23,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:23,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:23,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:23,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:23,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:23,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:23,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:23,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:24,109 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-11 11:03:24,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:24,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:24,134 INFO L478 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-01-11 11:03:24,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:24,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:24,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:25,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:27,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:27,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:27,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-11 11:03:27,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:27,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 11:03:27,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 11:03:27,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-01-11 11:03:27,957 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-01-11 11:03:29,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:29,917 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-01-11 11:03:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 11:03:29,917 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-01-11 11:03:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:29,918 INFO L225 Difference]: With dead ends: 220 [2019-01-11 11:03:29,918 INFO L226 Difference]: Without dead ends: 219 [2019-01-11 11:03:29,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:03:29,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-11 11:03:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-01-11 11:03:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-11 11:03:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-01-11 11:03:29,953 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-01-11 11:03:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:29,953 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-01-11 11:03:29,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 11:03:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-01-11 11:03:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-11 11:03:29,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:29,954 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-01-11 11:03:29,955 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:29,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-01-11 11:03:29,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:29,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:29,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:29,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:29,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:31,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:31,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:31,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:31,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:31,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:31,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:31,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:31,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:31,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:31,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:31,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:31,432 INFO L478 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-01-11 11:03:31,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:31,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:31,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:32,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:35,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:35,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-11 11:03:35,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:35,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-11 11:03:35,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-11 11:03:35,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:03:35,214 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-01-11 11:03:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:37,492 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-11 11:03:37,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:03:37,492 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-01-11 11:03:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:37,493 INFO L225 Difference]: With dead ends: 225 [2019-01-11 11:03:37,493 INFO L226 Difference]: Without dead ends: 224 [2019-01-11 11:03:37,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:03:37,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-11 11:03:37,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-01-11 11:03:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:03:37,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-11 11:03:37,528 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-01-11 11:03:37,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:37,528 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-11 11:03:37,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-11 11:03:37,528 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-11 11:03:37,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-11 11:03:37,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:37,529 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-01-11 11:03:37,529 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:37,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-01-11 11:03:37,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:37,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:37,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:37,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:38,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:38,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:38,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:38,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:38,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:38,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:38,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:38,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:38,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:38,736 INFO L478 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-01-11 11:03:38,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:38,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:38,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:40,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:42,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:42,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-11 11:03:42,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:42,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 11:03:42,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 11:03:42,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-01-11 11:03:42,873 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-01-11 11:03:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:45,052 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-01-11 11:03:45,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 11:03:45,052 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-01-11 11:03:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:45,053 INFO L225 Difference]: With dead ends: 230 [2019-01-11 11:03:45,054 INFO L226 Difference]: Without dead ends: 229 [2019-01-11 11:03:45,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:03:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-11 11:03:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-11 11:03:45,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-11 11:03:45,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-11 11:03:45,102 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-01-11 11:03:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:45,102 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-11 11:03:45,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 11:03:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-11 11:03:45,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-11 11:03:45,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:45,103 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-01-11 11:03:45,104 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:45,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:45,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-01-11 11:03:45,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:45,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:45,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:45,105 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:46,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:46,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:46,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:46,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:46,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:46,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:46,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:46,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:46,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-11 11:03:46,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:46,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:46,982 INFO L478 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-01-11 11:03:46,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:46,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:46,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:48,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:51,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:51,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-11 11:03:51,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:51,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 11:03:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 11:03:51,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:03:51,675 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-01-11 11:03:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:54,021 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-11 11:03:54,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 11:03:54,021 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-01-11 11:03:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:54,022 INFO L225 Difference]: With dead ends: 235 [2019-01-11 11:03:54,022 INFO L226 Difference]: Without dead ends: 234 [2019-01-11 11:03:54,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:03:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-11 11:03:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-01-11 11:03:54,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-11 11:03:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-01-11 11:03:54,082 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-01-11 11:03:54,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:54,082 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-01-11 11:03:54,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 11:03:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-01-11 11:03:54,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 11:03:54,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:54,084 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-01-11 11:03:54,084 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:54,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:54,084 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-01-11 11:03:54,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:54,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:54,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:54,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:55,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:55,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:55,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:55,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:55,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:55,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:55,467 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:55,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:55,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:55,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:55,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:55,625 INFO L478 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-01-11 11:03:55,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:55,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:55,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:57,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:00,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:00,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-11 11:04:00,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:00,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-11 11:04:00,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-11 11:04:00,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-01-11 11:04:00,141 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-01-11 11:04:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:02,790 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-11 11:04:02,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:04:02,790 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-01-11 11:04:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:02,792 INFO L225 Difference]: With dead ends: 240 [2019-01-11 11:04:02,792 INFO L226 Difference]: Without dead ends: 239 [2019-01-11 11:04:02,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:04:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-11 11:04:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-01-11 11:04:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-11 11:04:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-01-11 11:04:02,853 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-01-11 11:04:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:02,853 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-01-11 11:04:02,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-11 11:04:02,853 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-01-11 11:04:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-11 11:04:02,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:02,855 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-01-11 11:04:02,855 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:02,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-01-11 11:04:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:02,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:02,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:04,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:04,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:04,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:04,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:04,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:04,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:04,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:04,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:04,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:04,199 INFO L478 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-01-11 11:04:04,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:04,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:04,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:05,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:09,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:09,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-11 11:04:09,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:09,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-11 11:04:09,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-11 11:04:09,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:04:09,035 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-01-11 11:04:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:11,654 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-01-11 11:04:11,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 11:04:11,654 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-01-11 11:04:11,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:11,655 INFO L225 Difference]: With dead ends: 245 [2019-01-11 11:04:11,655 INFO L226 Difference]: Without dead ends: 244 [2019-01-11 11:04:11,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:04:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-11 11:04:11,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-01-11 11:04:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 11:04:11,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-11 11:04:11,697 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-01-11 11:04:11,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:11,698 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-11 11:04:11,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-11 11:04:11,698 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-11 11:04:11,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-11 11:04:11,698 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:11,699 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-01-11 11:04:11,699 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:11,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:11,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-01-11 11:04:11,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:11,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:11,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:11,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:11,700 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:13,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:13,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:13,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:13,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:13,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:13,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:13,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:13,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:13,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-11 11:04:13,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:13,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:13,329 INFO L478 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-01-11 11:04:13,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:13,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:13,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:14,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:18,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-11 11:04:18,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:18,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 11:04:18,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 11:04:18,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-01-11 11:04:18,092 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-01-11 11:04:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:20,492 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-11 11:04:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 11:04:20,493 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-01-11 11:04:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:20,494 INFO L225 Difference]: With dead ends: 250 [2019-01-11 11:04:20,494 INFO L226 Difference]: Without dead ends: 249 [2019-01-11 11:04:20,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-01-11 11:04:20,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-11 11:04:20,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-01-11 11:04:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-11 11:04:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-01-11 11:04:20,537 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-01-11 11:04:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:20,537 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-01-11 11:04:20,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 11:04:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-01-11 11:04:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-11 11:04:20,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:20,538 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-01-11 11:04:20,538 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:20,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:20,539 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-01-11 11:04:20,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:20,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:20,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:20,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:20,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:22,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:22,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:22,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:22,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:22,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:22,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:22,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:22,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:22,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:22,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:22,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:22,306 INFO L478 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-01-11 11:04:22,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:22,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:22,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:23,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:27,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:27,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-11 11:04:27,250 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:27,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-11 11:04:27,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-11 11:04:27,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:04:27,252 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-01-11 11:04:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:30,701 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-11 11:04:30,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 11:04:30,702 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-01-11 11:04:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:30,703 INFO L225 Difference]: With dead ends: 255 [2019-01-11 11:04:30,703 INFO L226 Difference]: Without dead ends: 254 [2019-01-11 11:04:30,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-01-11 11:04:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-11 11:04:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-11 11:04:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-11 11:04:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-01-11 11:04:30,754 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-01-11 11:04:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:30,755 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-01-11 11:04:30,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-11 11:04:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-01-11 11:04:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-11 11:04:30,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:30,756 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-01-11 11:04:30,757 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-01-11 11:04:30,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:30,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:30,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:32,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:32,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:32,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:32,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:32,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:32,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:32,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:32,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:32,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:32,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:32,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:32,785 INFO L478 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-01-11 11:04:32,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:32,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:32,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:34,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:37,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:37,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-01-11 11:04:37,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:37,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-11 11:04:37,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-11 11:04:37,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-01-11 11:04:37,996 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-01-11 11:04:40,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:40,620 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-01-11 11:04:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 11:04:40,620 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-01-11 11:04:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:40,621 INFO L225 Difference]: With dead ends: 260 [2019-01-11 11:04:40,621 INFO L226 Difference]: Without dead ends: 259 [2019-01-11 11:04:40,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-01-11 11:04:40,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-11 11:04:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-01-11 11:04:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-11 11:04:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-11 11:04:40,690 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-01-11 11:04:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:40,691 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-11 11:04:40,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-11 11:04:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-11 11:04:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-11 11:04:40,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:40,692 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-01-11 11:04:40,693 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:40,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:40,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-01-11 11:04:40,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:40,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:40,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:40,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:40,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:42,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:42,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:42,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:42,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:42,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:42,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:42,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:42,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:42,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:42,489 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-11 11:04:42,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:42,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:42,501 INFO L478 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-01-11 11:04:42,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:42,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:42,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:44,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:47,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:47,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-11 11:04:47,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:47,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 11:04:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 11:04:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:04:47,826 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-01-11 11:04:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:50,778 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-01-11 11:04:50,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:04:50,778 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-01-11 11:04:50,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:50,779 INFO L225 Difference]: With dead ends: 265 [2019-01-11 11:04:50,779 INFO L226 Difference]: Without dead ends: 264 [2019-01-11 11:04:50,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-01-11 11:04:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-11 11:04:50,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-01-11 11:04:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-11 11:04:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-11 11:04:50,831 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-01-11 11:04:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:50,831 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-11 11:04:50,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 11:04:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-11 11:04:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-11 11:04:50,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:50,832 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-01-11 11:04:50,833 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:50,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-01-11 11:04:50,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:50,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:50,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:52,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:52,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:52,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:52,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:52,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:52,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:52,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:52,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:52,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:52,443 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:52,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:52,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:52,456 INFO L478 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-01-11 11:04:52,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:52,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:52,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:54,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:54,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:57,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:57,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-11 11:04:57,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:57,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-11 11:04:57,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-11 11:04:57,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-01-11 11:04:57,937 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-01-11 11:05:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:00,805 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-11 11:05:00,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 11:05:00,806 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-01-11 11:05:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:00,807 INFO L225 Difference]: With dead ends: 270 [2019-01-11 11:05:00,807 INFO L226 Difference]: Without dead ends: 269 [2019-01-11 11:05:00,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-01-11 11:05:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-11 11:05:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-01-11 11:05:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-11 11:05:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-01-11 11:05:00,863 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-01-11 11:05:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:00,864 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-01-11 11:05:00,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-11 11:05:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-01-11 11:05:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-11 11:05:00,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:00,865 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-01-11 11:05:00,865 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-01-11 11:05:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:00,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:00,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:02,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:02,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:02,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:02,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:02,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:02,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:02,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:02,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:02,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:02,518 INFO L478 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-01-11 11:05:02,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:02,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:02,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:04,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:08,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:08,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-11 11:05:08,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:08,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-11 11:05:08,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-11 11:05:08,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:05:08,257 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-01-11 11:05:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:11,127 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-11 11:05:11,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 11:05:11,128 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-01-11 11:05:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:11,129 INFO L225 Difference]: With dead ends: 275 [2019-01-11 11:05:11,129 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 11:05:11,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-01-11 11:05:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 11:05:11,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-01-11 11:05:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-11 11:05:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-11 11:05:11,185 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-01-11 11:05:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:11,185 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-11 11:05:11,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-11 11:05:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-11 11:05:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-11 11:05:11,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:11,187 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-01-11 11:05:11,187 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:11,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-01-11 11:05:11,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:11,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:11,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:12,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:12,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:12,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:12,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:12,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:12,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:12,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:12,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:13,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-11 11:05:13,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:13,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:13,286 INFO L478 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-01-11 11:05:13,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:13,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:13,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:15,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:18,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:18,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:18,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-11 11:05:18,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:18,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 11:05:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 11:05:18,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-01-11 11:05:18,790 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-01-11 11:05:21,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:21,779 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-01-11 11:05:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 11:05:21,780 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-01-11 11:05:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:21,781 INFO L225 Difference]: With dead ends: 280 [2019-01-11 11:05:21,781 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 11:05:21,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-01-11 11:05:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 11:05:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-01-11 11:05:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 11:05:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-01-11 11:05:21,844 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-01-11 11:05:21,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:21,844 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-01-11 11:05:21,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 11:05:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-01-11 11:05:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-11 11:05:21,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:21,846 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-01-11 11:05:21,847 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-01-11 11:05:21,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:21,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:21,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:21,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:21,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:23,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:23,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:23,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:23,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:23,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:23,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:23,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:23,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:23,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:23,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:23,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:23,861 INFO L478 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-01-11 11:05:23,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:23,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:23,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:25,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:29,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:29,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-11 11:05:29,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:29,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-11 11:05:29,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-11 11:05:29,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:05:29,551 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-01-11 11:05:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:32,580 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-11 11:05:32,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:05:32,580 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-01-11 11:05:32,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:32,581 INFO L225 Difference]: With dead ends: 285 [2019-01-11 11:05:32,581 INFO L226 Difference]: Without dead ends: 284 [2019-01-11 11:05:32,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-01-11 11:05:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-11 11:05:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-01-11 11:05:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-11 11:05:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-11 11:05:32,636 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-01-11 11:05:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:32,636 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-11 11:05:32,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-11 11:05:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-11 11:05:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-11 11:05:32,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:32,637 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-01-11 11:05:32,637 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-01-11 11:05:32,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:32,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:32,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:32,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:34,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:34,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:34,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:34,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:34,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:34,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:34,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:34,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:34,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:34,774 INFO L478 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-01-11 11:05:34,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:34,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:34,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:36,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:40,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:40,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-11 11:05:40,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:40,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-11 11:05:40,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-11 11:05:40,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 11:05:40,681 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-01-11 11:05:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:44,060 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-01-11 11:05:44,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 11:05:44,060 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-01-11 11:05:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:44,061 INFO L225 Difference]: With dead ends: 290 [2019-01-11 11:05:44,061 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 11:05:44,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-01-11 11:05:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 11:05:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-01-11 11:05:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-11 11:05:44,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-01-11 11:05:44,118 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-01-11 11:05:44,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:44,118 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-01-11 11:05:44,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-11 11:05:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-01-11 11:05:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-01-11 11:05:44,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:44,119 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-01-11 11:05:44,120 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:44,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:44,120 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-01-11 11:05:44,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:44,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:44,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:44,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:44,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:45,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:45,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:45,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:45,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:45,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:45,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:45,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:45,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:46,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-11 11:05:46,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:46,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:46,288 INFO L478 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-01-11 11:05:46,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:46,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:46,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:48,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:52,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:52,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-11 11:05:52,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:52,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-11 11:05:52,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-11 11:05:52,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:05:52,312 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-01-11 11:05:55,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:55,786 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-11 11:05:55,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 11:05:55,786 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-01-11 11:05:55,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:55,787 INFO L225 Difference]: With dead ends: 295 [2019-01-11 11:05:55,787 INFO L226 Difference]: Without dead ends: 294 [2019-01-11 11:05:55,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-01-11 11:05:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-11 11:05:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-01-11 11:05:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-11 11:05:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-01-11 11:05:55,849 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-01-11 11:05:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:55,849 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-01-11 11:05:55,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-11 11:05:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-01-11 11:05:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-11 11:05:55,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:55,851 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-01-11 11:05:55,851 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-01-11 11:05:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:55,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:55,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:55,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:57,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:57,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:57,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:57,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:57,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:57,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:57,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:57,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:57,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:57,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:57,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:57,850 INFO L478 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-01-11 11:05:57,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:57,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:57,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:00,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:03,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:03,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-11 11:06:03,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:03,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-11 11:06:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-11 11:06:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-01-11 11:06:03,869 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-01-11 11:06:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:07,443 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-01-11 11:06:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:06:07,443 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-01-11 11:06:07,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:07,444 INFO L225 Difference]: With dead ends: 300 [2019-01-11 11:06:07,444 INFO L226 Difference]: Without dead ends: 299 [2019-01-11 11:06:07,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-01-11 11:06:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-11 11:06:07,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-01-11 11:06:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-11 11:06:07,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-01-11 11:06:07,516 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-01-11 11:06:07,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:07,516 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-01-11 11:06:07,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-11 11:06:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-01-11 11:06:07,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-11 11:06:07,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:07,518 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-01-11 11:06:07,518 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:07,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:07,518 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-01-11 11:06:07,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:07,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:07,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:07,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:07,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:09,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:09,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:09,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:09,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:09,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:09,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:09,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:09,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:09,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:09,593 INFO L478 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-01-11 11:06:09,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:09,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:09,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:11,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:15,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:15,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-11 11:06:15,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:15,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-11 11:06:15,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-11 11:06:15,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:06:15,907 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-01-11 11:06:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:19,393 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-01-11 11:06:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:06:19,393 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-01-11 11:06:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:19,394 INFO L225 Difference]: With dead ends: 305 [2019-01-11 11:06:19,394 INFO L226 Difference]: Without dead ends: 304 [2019-01-11 11:06:19,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-01-11 11:06:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-11 11:06:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-01-11 11:06:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-11 11:06:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-11 11:06:19,466 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-01-11 11:06:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:19,466 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-11 11:06:19,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-11 11:06:19,466 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-11 11:06:19,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-11 11:06:19,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:19,467 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-01-11 11:06:19,468 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-01-11 11:06:19,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:19,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:19,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:19,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:21,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:21,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:21,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:21,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:21,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:21,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:21,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:21,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:21,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:21,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-11 11:06:21,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:21,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:21,907 INFO L478 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-01-11 11:06:21,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:21,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:21,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:24,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:28,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:28,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:28,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-11 11:06:28,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:28,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-11 11:06:28,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-11 11:06:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 11:06:28,057 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-01-11 11:06:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:31,676 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-01-11 11:06:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 11:06:31,677 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-01-11 11:06:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:31,678 INFO L225 Difference]: With dead ends: 310 [2019-01-11 11:06:31,678 INFO L226 Difference]: Without dead ends: 309 [2019-01-11 11:06:31,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-01-11 11:06:31,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-11 11:06:31,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-01-11 11:06:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-11 11:06:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-01-11 11:06:31,742 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-01-11 11:06:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:31,742 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-01-11 11:06:31,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-11 11:06:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-01-11 11:06:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-11 11:06:31,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:31,744 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-01-11 11:06:31,744 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:31,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-01-11 11:06:31,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:31,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:31,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:33,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:33,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:33,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:33,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:33,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:33,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:33,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:33,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:33,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:33,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:33,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:33,848 INFO L478 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-01-11 11:06:33,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:33,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:33,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:36,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:40,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:40,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:40,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-11 11:06:40,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:40,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-11 11:06:40,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-11 11:06:40,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:06:40,600 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-01-11 11:06:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:44,268 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-11 11:06:44,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 11:06:44,268 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-01-11 11:06:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:44,270 INFO L225 Difference]: With dead ends: 315 [2019-01-11 11:06:44,270 INFO L226 Difference]: Without dead ends: 314 [2019-01-11 11:06:44,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-01-11 11:06:44,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-11 11:06:44,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-01-11 11:06:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-11 11:06:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-01-11 11:06:44,353 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-01-11 11:06:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:44,354 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-01-11 11:06:44,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-11 11:06:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-01-11 11:06:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-11 11:06:44,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:44,355 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-01-11 11:06:44,355 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:44,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:44,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-01-11 11:06:44,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:44,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:44,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:44,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:46,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:46,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:46,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:46,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:46,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:46,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:46,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:46,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:46,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:46,782 INFO L478 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-01-11 11:06:46,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:46,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:46,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:49,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:53,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:53,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-11 11:06:53,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:53,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-11 11:06:53,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-11 11:06:53,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-01-11 11:06:53,186 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-01-11 11:06:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:57,191 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-01-11 11:06:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-11 11:06:57,192 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-01-11 11:06:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:57,193 INFO L225 Difference]: With dead ends: 320 [2019-01-11 11:06:57,193 INFO L226 Difference]: Without dead ends: 319 [2019-01-11 11:06:57,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-01-11 11:06:57,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-11 11:06:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-01-11 11:06:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-11 11:06:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-01-11 11:06:57,265 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-01-11 11:06:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:57,265 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-01-11 11:06:57,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-11 11:06:57,265 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-01-11 11:06:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-11 11:06:57,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:57,267 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-01-11 11:06:57,267 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:57,267 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-01-11 11:06:57,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:57,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:57,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:57,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:57,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:59,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:59,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:59,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:59,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:59,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:59,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:59,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:59,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:59,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:59,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-11 11:06:59,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:59,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:59,765 INFO L478 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-01-11 11:06:59,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:59,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:59,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:02,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:06,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:06,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-11 11:07:06,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:06,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-11 11:07:06,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-11 11:07:06,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:07:06,394 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-01-11 11:07:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:10,128 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-01-11 11:07:10,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:07:10,129 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-01-11 11:07:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:10,130 INFO L225 Difference]: With dead ends: 325 [2019-01-11 11:07:10,130 INFO L226 Difference]: Without dead ends: 324 [2019-01-11 11:07:10,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-01-11 11:07:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-11 11:07:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-01-11 11:07:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-11 11:07:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-11 11:07:10,203 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-01-11 11:07:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:10,203 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-11 11:07:10,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-11 11:07:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-11 11:07:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-11 11:07:10,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:10,205 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-01-11 11:07:10,205 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:07:10,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:10,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-01-11 11:07:10,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:10,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:10,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:12,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:12,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:12,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:12,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:12,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:12,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:12,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:07:12,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:07:12,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:07:12,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:12,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:12,786 INFO L478 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-01-11 11:07:12,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:12,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:12,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:15,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:19,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:19,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-11 11:07:19,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:19,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-11 11:07:19,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-11 11:07:19,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-01-11 11:07:19,320 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-01-11 11:07:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:23,495 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-01-11 11:07:23,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:07:23,495 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-01-11 11:07:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:23,496 INFO L225 Difference]: With dead ends: 330 [2019-01-11 11:07:23,496 INFO L226 Difference]: Without dead ends: 329 [2019-01-11 11:07:23,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-01-11 11:07:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-01-11 11:07:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-01-11 11:07:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-11 11:07:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-01-11 11:07:23,573 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-01-11 11:07:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:23,573 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-01-11 11:07:23,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-11 11:07:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-01-11 11:07:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-11 11:07:23,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:23,574 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-01-11 11:07:23,575 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:07:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-01-11 11:07:23,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:23,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:23,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:23,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:25,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:25,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:25,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:25,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:25,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:25,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:25,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:25,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:07:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:25,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:25,972 INFO L478 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-01-11 11:07:25,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:25,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:25,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:28,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:32,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:32,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-11 11:07:32,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:32,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-11 11:07:32,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-11 11:07:32,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:07:32,875 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-01-11 11:07:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:37,149 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-11 11:07:37,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 11:07:37,150 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-01-11 11:07:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:37,151 INFO L225 Difference]: With dead ends: 335 [2019-01-11 11:07:37,151 INFO L226 Difference]: Without dead ends: 334 [2019-01-11 11:07:37,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-01-11 11:07:37,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-11 11:07:37,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-01-11 11:07:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-11 11:07:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-01-11 11:07:37,230 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-01-11 11:07:37,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:37,230 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-01-11 11:07:37,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-11 11:07:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-01-11 11:07:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-11 11:07:37,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:37,232 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-01-11 11:07:37,232 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:07:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:37,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-01-11 11:07:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:37,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:39,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:39,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:39,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:39,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:39,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:39,486 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-01-11 11:07:39,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:39,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:40,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-11 11:07:40,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:40,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:40,021 INFO L478 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-01-11 11:07:40,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:40,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:40,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:42,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:46,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:46,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-11 11:07:46,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:46,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-11 11:07:46,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-11 11:07:46,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-01-11 11:07:46,958 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-01-11 11:07:51,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:51,140 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-01-11 11:07:51,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-11 11:07:51,141 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-01-11 11:07:51,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:51,142 INFO L225 Difference]: With dead ends: 340 [2019-01-11 11:07:51,142 INFO L226 Difference]: Without dead ends: 339 [2019-01-11 11:07:51,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-01-11 11:07:51,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-11 11:07:51,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-01-11 11:07:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-11 11:07:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-01-11 11:07:51,228 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-01-11 11:07:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:51,228 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-01-11 11:07:51,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-11 11:07:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-01-11 11:07:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-11 11:07:51,229 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:51,230 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-01-11 11:07:51,230 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:07:51,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:51,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-01-11 11:07:51,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:51,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:51,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:51,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:53,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:53,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:53,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:53,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:53,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:53,679 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-01-11 11:07:53,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:07:53,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:07:53,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:07:53,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:53,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:53,917 INFO L478 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-01-11 11:07:53,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:53,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:53,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:56,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:00,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:00,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-11 11:08:00,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:00,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-11 11:08:00,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-11 11:08:00,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:08:00,968 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-01-11 11:08:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:05,486 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-01-11 11:08:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 11:08:05,487 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-01-11 11:08:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:05,488 INFO L225 Difference]: With dead ends: 345 [2019-01-11 11:08:05,488 INFO L226 Difference]: Without dead ends: 344 [2019-01-11 11:08:05,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-01-11 11:08:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-11 11:08:05,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-01-11 11:08:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 11:08:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-11 11:08:05,579 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-01-11 11:08:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:05,580 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-11 11:08:05,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-11 11:08:05,580 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-11 11:08:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-11 11:08:05,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:05,581 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-01-11 11:08:05,581 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:08:05,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:05,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-01-11 11:08:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:05,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:05,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:05,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:07,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:07,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:07,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:07,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:07,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:07,900 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-01-11 11:08:07,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:07,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:08,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:08,124 INFO L478 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-01-11 11:08:08,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:08,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:08,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:11,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:15,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:15,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-11 11:08:15,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:15,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-11 11:08:15,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-11 11:08:15,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-01-11 11:08:15,203 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-01-11 11:08:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:19,892 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-01-11 11:08:19,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 11:08:19,892 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-01-11 11:08:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:19,894 INFO L225 Difference]: With dead ends: 350 [2019-01-11 11:08:19,894 INFO L226 Difference]: Without dead ends: 349 [2019-01-11 11:08:19,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-01-11 11:08:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-11 11:08:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-01-11 11:08:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-01-11 11:08:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-01-11 11:08:19,980 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-01-11 11:08:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:19,980 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-01-11 11:08:19,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-11 11:08:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-01-11 11:08:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-11 11:08:19,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:19,982 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-01-11 11:08:19,982 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:08:19,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-01-11 11:08:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:19,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:19,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:19,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:19,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:22,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:22,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:22,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:22,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:22,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:22,388 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-01-11 11:08:22,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:08:22,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:08:22,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-11 11:08:22,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:22,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:22,966 INFO L478 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-01-11 11:08:22,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:22,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:22,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:25,872 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:25,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:30,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:30,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-11 11:08:30,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:30,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-11 11:08:30,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-11 11:08:30,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:08:30,129 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-01-11 11:08:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:34,820 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-11 11:08:34,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 11:08:34,820 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-01-11 11:08:34,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:34,821 INFO L225 Difference]: With dead ends: 355 [2019-01-11 11:08:34,822 INFO L226 Difference]: Without dead ends: 354 [2019-01-11 11:08:34,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-01-11 11:08:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-11 11:08:34,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-01-11 11:08:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-11 11:08:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-01-11 11:08:34,913 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-01-11 11:08:34,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:34,914 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-01-11 11:08:34,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-11 11:08:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-01-11 11:08:34,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-11 11:08:34,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:34,915 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-01-11 11:08:34,915 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:08:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:34,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-01-11 11:08:34,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:34,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:34,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:34,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:37,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:37,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:37,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:37,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:37,346 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-01-11 11:08:37,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:08:37,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:08:37,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:08:37,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:37,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:37,631 INFO L478 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-01-11 11:08:37,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:37,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:37,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:40,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:45,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:45,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-11 11:08:45,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:45,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-11 11:08:45,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-11 11:08:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-01-11 11:08:45,423 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-01-11 11:08:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:50,276 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-01-11 11:08:50,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 11:08:50,277 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-01-11 11:08:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:50,278 INFO L225 Difference]: With dead ends: 360 [2019-01-11 11:08:50,278 INFO L226 Difference]: Without dead ends: 359 [2019-01-11 11:08:50,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-01-11 11:08:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-11 11:08:50,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-01-11 11:08:50,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-11 11:08:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-01-11 11:08:50,368 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-01-11 11:08:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:50,368 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-01-11 11:08:50,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-11 11:08:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-01-11 11:08:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-11 11:08:50,370 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:50,370 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-01-11 11:08:50,370 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:08:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:50,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-01-11 11:08:50,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:50,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:50,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:50,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:50,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:52,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:52,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:52,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:52,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:52,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:52,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 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-01-11 11:08:52,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:52,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:53,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:53,081 INFO L478 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-01-11 11:08:53,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:53,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:53,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:56,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:00,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:00,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:00,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-11 11:09:00,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:00,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-11 11:09:00,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-11 11:09:00,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:09:00,616 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-01-11 11:09:05,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:05,681 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-01-11 11:09:05,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:09:05,681 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-01-11 11:09:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:05,683 INFO L225 Difference]: With dead ends: 365 [2019-01-11 11:09:05,683 INFO L226 Difference]: Without dead ends: 364 [2019-01-11 11:09:05,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-01-11 11:09:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-11 11:09:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-01-11 11:09:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-11 11:09:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-11 11:09:05,777 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-01-11 11:09:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:05,777 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-11 11:09:05,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-11 11:09:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-11 11:09:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-11 11:09:05,779 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:05,779 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-01-11 11:09:05,779 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:09:05,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:05,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-01-11 11:09:05,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:05,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:05,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:05,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:05,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:08,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:08,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:08,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:08,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:08,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:08,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 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-01-11 11:09:08,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:09:08,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:09:09,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-11 11:09:09,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:09,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:09,203 INFO L478 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-01-11 11:09:09,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:09,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:09,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:12,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:16,656 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:16,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:16,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-11 11:09:16,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:16,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-11 11:09:16,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-11 11:09:16,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-01-11 11:09:16,680 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-01-11 11:09:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:21,687 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-01-11 11:09:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 11:09:21,688 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-01-11 11:09:21,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:21,689 INFO L225 Difference]: With dead ends: 370 [2019-01-11 11:09:21,689 INFO L226 Difference]: Without dead ends: 369 [2019-01-11 11:09:21,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-01-11 11:09:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-11 11:09:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-01-11 11:09:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-11 11:09:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-01-11 11:09:21,789 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-01-11 11:09:21,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:21,789 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-01-11 11:09:21,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-11 11:09:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-01-11 11:09:21,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-01-11 11:09:21,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:21,791 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-01-11 11:09:21,791 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:09:21,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:21,791 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-01-11 11:09:21,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:21,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:21,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:21,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:21,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:24,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:24,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:24,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:24,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:24,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:24,775 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-01-11 11:09:24,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:09:24,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:09:25,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:09:25,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:25,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:25,032 INFO L478 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-01-11 11:09:25,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:25,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:25,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:28,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:32,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:32,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-11 11:09:32,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:32,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-11 11:09:32,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-11 11:09:32,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:09:32,662 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-01-11 11:09:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:37,861 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-11 11:09:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 11:09:37,862 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-01-11 11:09:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:37,863 INFO L225 Difference]: With dead ends: 375 [2019-01-11 11:09:37,863 INFO L226 Difference]: Without dead ends: 374 [2019-01-11 11:09:37,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-01-11 11:09:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-11 11:09:37,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-01-11 11:09:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-01-11 11:09:37,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-01-11 11:09:37,959 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-01-11 11:09:37,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:37,959 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-01-11 11:09:37,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-11 11:09:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-01-11 11:09:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-11 11:09:37,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:37,961 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-01-11 11:09:37,961 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:09:37,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-01-11 11:09:37,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:37,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:37,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:37,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:37,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:40,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:40,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:40,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:40,915 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:40,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:40,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 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-01-11 11:09:40,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:40,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:09:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:41,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:41,154 INFO L478 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-01-11 11:09:41,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:41,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:41,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:44,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:48,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:48,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-11 11:09:48,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:48,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-11 11:09:48,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-11 11:09:48,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-01-11 11:09:48,707 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-01-11 11:09:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:54,018 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-01-11 11:09:54,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-11 11:09:54,019 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-01-11 11:09:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:54,020 INFO L225 Difference]: With dead ends: 380 [2019-01-11 11:09:54,020 INFO L226 Difference]: Without dead ends: 379 [2019-01-11 11:09:54,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-01-11 11:09:54,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-11 11:09:54,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-01-11 11:09:54,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-11 11:09:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-01-11 11:09:54,122 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-01-11 11:09:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:54,122 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-01-11 11:09:54,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-11 11:09:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-01-11 11:09:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-11 11:09:54,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:54,124 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-01-11 11:09:54,124 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:09:54,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:54,124 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-01-11 11:09:54,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:54,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:54,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:54,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:54,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:57,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:57,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:57,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:57,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:57,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:57,100 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-01-11 11:09:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:09:57,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:09:57,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-11 11:09:57,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:57,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:57,771 INFO L478 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-01-11 11:09:57,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:57,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:57,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:01,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:05,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:05,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-11 11:10:05,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:05,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-11 11:10:05,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-11 11:10:05,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:10:05,869 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-01-11 11:10:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:11,021 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-01-11 11:10:11,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 11:10:11,021 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-01-11 11:10:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:11,022 INFO L225 Difference]: With dead ends: 385 [2019-01-11 11:10:11,023 INFO L226 Difference]: Without dead ends: 384 [2019-01-11 11:10:11,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-01-11 11:10:11,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-01-11 11:10:11,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-01-11 11:10:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-11 11:10:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-11 11:10:11,128 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-01-11 11:10:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:11,128 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-11 11:10:11,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-11 11:10:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-11 11:10:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-11 11:10:11,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:11,130 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-01-11 11:10:11,130 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:10:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-01-11 11:10:11,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:11,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:11,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:14,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:14,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:14,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:14,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:14,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:14,029 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-01-11 11:10:14,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:10:14,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:10:14,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:10:14,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:14,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:14,291 INFO L478 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-01-11 11:10:14,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:14,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:14,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:18,056 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:18,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:22,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:22,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-11 11:10:22,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:22,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-11 11:10:22,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-11 11:10:22,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-01-11 11:10:22,568 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-01-11 11:10:28,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:28,117 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-01-11 11:10:28,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 11:10:28,117 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-01-11 11:10:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:28,118 INFO L225 Difference]: With dead ends: 390 [2019-01-11 11:10:28,119 INFO L226 Difference]: Without dead ends: 389 [2019-01-11 11:10:28,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-01-11 11:10:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-01-11 11:10:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-01-11 11:10:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-11 11:10:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-01-11 11:10:28,264 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-01-11 11:10:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:28,264 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-01-11 11:10:28,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-11 11:10:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-01-11 11:10:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-11 11:10:28,266 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:28,266 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-01-11 11:10:28,266 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:10:28,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-01-11 11:10:28,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:28,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:28,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:28,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:28,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:31,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:31,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:31,463 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:31,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:31,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:31,463 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-01-11 11:10:31,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:31,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:31,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:31,712 INFO L478 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-01-11 11:10:31,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:31,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:35,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:39,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:39,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-11 11:10:39,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:39,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-11 11:10:39,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-11 11:10:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:10:39,527 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-01-11 11:10:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:45,361 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-11 11:10:45,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 11:10:45,361 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-01-11 11:10:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:45,362 INFO L225 Difference]: With dead ends: 395 [2019-01-11 11:10:45,362 INFO L226 Difference]: Without dead ends: 394 [2019-01-11 11:10:45,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-01-11 11:10:45,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-11 11:10:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-01-11 11:10:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-11 11:10:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-01-11 11:10:45,475 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-01-11 11:10:45,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:45,475 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-01-11 11:10:45,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-11 11:10:45,476 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-01-11 11:10:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-01-11 11:10:45,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:45,477 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-01-11 11:10:45,477 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:10:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:45,478 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-01-11 11:10:45,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:45,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:45,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:48,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:48,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:48,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:48,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:48,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:48,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:48,712 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-01-11 11:10:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:10:48,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:10:49,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-11 11:10:49,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:49,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:49,429 INFO L478 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-01-11 11:10:49,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:49,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:49,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:53,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:57,637 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:57,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:57,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-11 11:10:57,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:57,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-11 11:10:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-11 11:10:57,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-01-11 11:10:57,662 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-01-11 11:11:03,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:03,381 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-01-11 11:11:03,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-11 11:11:03,382 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-01-11 11:11:03,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:03,383 INFO L225 Difference]: With dead ends: 400 [2019-01-11 11:11:03,383 INFO L226 Difference]: Without dead ends: 399 [2019-01-11 11:11:03,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-01-11 11:11:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-11 11:11:03,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-01-11 11:11:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-11 11:11:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-01-11 11:11:03,495 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-01-11 11:11:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:03,495 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-01-11 11:11:03,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-11 11:11:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-01-11 11:11:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-01-11 11:11:03,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:03,497 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-01-11 11:11:03,497 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:11:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-01-11 11:11:03,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:03,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:03,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:03,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:06,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:06,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:06,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:06,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:06,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:06,804 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-01-11 11:11:06,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:11:06,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:11:07,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:11:07,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:07,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:07,085 INFO L478 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-01-11 11:11:07,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:07,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:07,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:10,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:15,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:15,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-11 11:11:15,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:15,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-11 11:11:15,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-11 11:11:15,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:11:15,339 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-01-11 11:11:21,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:21,226 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-01-11 11:11:21,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 11:11:21,226 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-01-11 11:11:21,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:21,228 INFO L225 Difference]: With dead ends: 405 [2019-01-11 11:11:21,228 INFO L226 Difference]: Without dead ends: 404 [2019-01-11 11:11:21,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-01-11 11:11:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-01-11 11:11:21,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-01-11 11:11:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-11 11:11:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-11 11:11:21,342 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-01-11 11:11:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:21,342 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-11 11:11:21,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-11 11:11:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-11 11:11:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-11 11:11:21,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:21,344 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-01-11 11:11:21,344 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:11:21,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:21,344 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-01-11 11:11:21,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:21,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:21,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:21,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:24,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:24,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:24,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:24,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:24,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:24,691 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-01-11 11:11:24,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:24,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:24,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:24,953 INFO L478 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-01-11 11:11:24,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:24,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:29,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:33,636 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:33,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:33,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-11 11:11:33,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:33,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-11 11:11:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-11 11:11:33,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-01-11 11:11:33,660 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-01-11 11:11:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:39,617 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-01-11 11:11:39,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-11 11:11:39,618 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-01-11 11:11:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:39,619 INFO L225 Difference]: With dead ends: 410 [2019-01-11 11:11:39,619 INFO L226 Difference]: Without dead ends: 409 [2019-01-11 11:11:39,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-01-11 11:11:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-01-11 11:11:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-01-11 11:11:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-01-11 11:11:39,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-01-11 11:11:39,743 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-01-11 11:11:39,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:39,743 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-01-11 11:11:39,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-11 11:11:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-01-11 11:11:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-01-11 11:11:39,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:39,745 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-01-11 11:11:39,745 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:11:39,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:39,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-01-11 11:11:39,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:39,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:39,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:39,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:39,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:43,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:43,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:43,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:43,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:43,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:43,145 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-01-11 11:11:43,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:43,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:43,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-11 11:11:43,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:43,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:43,930 INFO L478 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-01-11 11:11:43,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:43,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:48,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:52,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:52,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-11 11:11:52,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:52,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-11 11:11:52,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-11 11:11:52,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:11:52,469 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-01-11 11:11:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:58,747 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-01-11 11:11:58,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 11:11:58,747 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-01-11 11:11:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:58,749 INFO L225 Difference]: With dead ends: 415 [2019-01-11 11:11:58,749 INFO L226 Difference]: Without dead ends: 414 [2019-01-11 11:11:58,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-01-11 11:11:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-11 11:11:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-01-11 11:11:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-01-11 11:11:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-01-11 11:11:58,875 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-01-11 11:11:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:58,876 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-01-11 11:11:58,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-11 11:11:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-01-11 11:11:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-01-11 11:11:58,877 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:58,877 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-01-11 11:11:58,878 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:11:58,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-01-11 11:11:58,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:58,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:58,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:58,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:58,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:02,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:02,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:02,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:02,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:02,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:02,098 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-01-11 11:12:02,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:12:02,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:12:02,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:12:02,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:02,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:02,444 INFO L478 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-01-11 11:12:02,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:02,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:02,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:06,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:11,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:11,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-11 11:12:11,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:11,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-11 11:12:11,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-11 11:12:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-01-11 11:12:11,326 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-01-11 11:12:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:17,628 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-01-11 11:12:17,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 11:12:17,629 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-01-11 11:12:17,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:17,630 INFO L225 Difference]: With dead ends: 420 [2019-01-11 11:12:17,630 INFO L226 Difference]: Without dead ends: 419 [2019-01-11 11:12:17,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-01-11 11:12:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-01-11 11:12:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-01-11 11:12:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-01-11 11:12:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-01-11 11:12:17,760 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-01-11 11:12:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:17,760 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-01-11 11:12:17,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-11 11:12:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-01-11 11:12:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-01-11 11:12:17,762 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:17,762 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-01-11 11:12:17,762 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:12:17,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:17,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-01-11 11:12:17,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:17,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:17,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:17,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:17,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:21,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:21,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:21,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:21,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:21,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:21,216 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-01-11 11:12:21,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:21,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:12:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:21,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:21,552 INFO L478 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-01-11 11:12:21,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:21,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:21,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:25,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:30,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:30,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:30,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-11 11:12:30,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:30,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-11 11:12:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-11 11:12:30,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 11:12:30,429 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-01-11 11:12:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:36,925 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-01-11 11:12:36,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 11:12:36,926 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-01-11 11:12:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:36,927 INFO L225 Difference]: With dead ends: 425 [2019-01-11 11:12:36,927 INFO L226 Difference]: Without dead ends: 424 [2019-01-11 11:12:36,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 660 SyntacticMatches, 66 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33799 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=26012, Invalid=47700, Unknown=0, NotChecked=0, Total=73712 [2019-01-11 11:12:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-11 11:12:37,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-01-11 11:12:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-11 11:12:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-01-11 11:12:37,056 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-01-11 11:12:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:37,057 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-01-11 11:12:37,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-11 11:12:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-01-11 11:12:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-11 11:12:37,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:37,059 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-01-11 11:12:37,059 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:12:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:37,059 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-01-11 11:12:37,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:37,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:37,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:37,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:37,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:40,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:40,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:40,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:40,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:40,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:40,969 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-01-11 11:12:40,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:12:40,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:12:41,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-11 11:12:41,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:41,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:41,794 INFO L478 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-01-11 11:12:41,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:41,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:41,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:46,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:46,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:50,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:50,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-11 11:12:50,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:50,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-11 11:12:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-11 11:12:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13727, Invalid=21805, Unknown=0, NotChecked=0, Total=35532 [2019-01-11 11:12:50,880 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-01-11 11:12:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:57,436 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-01-11 11:12:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-11 11:12:57,437 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-01-11 11:12:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:57,438 INFO L225 Difference]: With dead ends: 430 [2019-01-11 11:12:57,438 INFO L226 Difference]: Without dead ends: 429 [2019-01-11 11:12:57,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 668 SyntacticMatches, 68 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34468 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=26304, Invalid=48498, Unknown=0, NotChecked=0, Total=74802 [2019-01-11 11:12:57,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-01-11 11:12:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-01-11 11:12:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-11 11:12:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-01-11 11:12:57,575 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-01-11 11:12:57,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:57,575 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-01-11 11:12:57,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-11 11:12:57,576 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-01-11 11:12:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-01-11 11:12:57,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:57,577 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-01-11 11:12:57,578 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:12:57,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:57,578 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-01-11 11:12:57,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:57,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:57,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:57,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:01,337 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:01,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:01,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:01,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:01,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:01,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:01,338 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:01,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:13:01,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:13:01,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:13:01,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:01,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:01,637 INFO L478 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-01-11 11:13:01,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:01,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:01,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:13:05,986 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:05,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:10,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:10,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-11 11:13:10,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:10,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-11 11:13:10,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-11 11:13:10,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13829, Invalid=22081, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:13:10,535 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2019-01-11 11:13:17,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:17,257 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2019-01-11 11:13:17,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 11:13:17,258 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2019-01-11 11:13:17,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:17,259 INFO L225 Difference]: With dead ends: 435 [2019-01-11 11:13:17,260 INFO L226 Difference]: Without dead ends: 434 [2019-01-11 11:13:17,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 676 SyntacticMatches, 70 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35139 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=26597, Invalid=49303, Unknown=0, NotChecked=0, Total=75900 [2019-01-11 11:13:17,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-11 11:13:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-01-11 11:13:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-01-11 11:13:17,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2019-01-11 11:13:17,395 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2019-01-11 11:13:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:17,396 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2019-01-11 11:13:17,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-11 11:13:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2019-01-11 11:13:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-01-11 11:13:17,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:17,398 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2019-01-11 11:13:17,398 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:13:17,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2019-01-11 11:13:17,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:17,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:17,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:17,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:21,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:21,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:21,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:21,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:21,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:21,197 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:21,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:21,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:21,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:21,515 INFO L478 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-01-11 11:13:21,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:13:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:25,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:30,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:30,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-01-11 11:13:30,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:30,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-11 11:13:30,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-11 11:13:30,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13931, Invalid=22359, Unknown=0, NotChecked=0, Total=36290 [2019-01-11 11:13:30,622 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 176 states. [2019-01-11 11:13:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:37,325 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2019-01-11 11:13:37,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-11 11:13:37,325 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 430 [2019-01-11 11:13:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:37,327 INFO L225 Difference]: With dead ends: 440 [2019-01-11 11:13:37,327 INFO L226 Difference]: Without dead ends: 439 [2019-01-11 11:13:37,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 684 SyntacticMatches, 72 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35812 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=26891, Invalid=50115, Unknown=0, NotChecked=0, Total=77006 [2019-01-11 11:13:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-11 11:13:37,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2019-01-11 11:13:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-01-11 11:13:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2019-01-11 11:13:37,471 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2019-01-11 11:13:37,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:37,471 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2019-01-11 11:13:37,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-11 11:13:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2019-01-11 11:13:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-01-11 11:13:37,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:37,473 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2019-01-11 11:13:37,473 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:13:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash 230864771, now seen corresponding path program 86 times [2019-01-11 11:13:37,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:37,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:37,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:37,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:37,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:41,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:41,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:41,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:41,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:41,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:41,436 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:41,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:41,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:42,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-01-11 11:13:42,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:42,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:42,325 INFO L478 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-01-11 11:13:42,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:13:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:46,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:51,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:51,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:51,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 190 [2019-01-11 11:13:51,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:51,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-01-11 11:13:51,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-01-11 11:13:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14033, Invalid=22639, Unknown=0, NotChecked=0, Total=36672 [2019-01-11 11:13:51,731 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 178 states. [2019-01-11 11:13:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:58,686 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2019-01-11 11:13:58,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 11:13:58,686 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 435 [2019-01-11 11:13:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:58,688 INFO L225 Difference]: With dead ends: 445 [2019-01-11 11:13:58,688 INFO L226 Difference]: Without dead ends: 444 [2019-01-11 11:13:58,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 692 SyntacticMatches, 74 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36487 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=27186, Invalid=50934, Unknown=0, NotChecked=0, Total=78120 [2019-01-11 11:13:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-01-11 11:13:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2019-01-11 11:13:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-01-11 11:13:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2019-01-11 11:13:58,832 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 435 [2019-01-11 11:13:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:58,833 INFO L480 AbstractCegarLoop]: Abstraction has 441 states and 441 transitions. [2019-01-11 11:13:58,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-01-11 11:13:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 441 transitions. [2019-01-11 11:13:58,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-01-11 11:13:58,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:58,834 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 88, 87, 87, 1, 1] [2019-01-11 11:13:58,835 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:13:58,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:58,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1688536691, now seen corresponding path program 87 times [2019-01-11 11:13:58,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:58,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:58,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:58,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:58,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat