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-b7bd044-m [2019-01-20 09:57:37,150 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 09:57:37,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 09:57:37,163 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 09:57:37,164 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 09:57:37,165 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 09:57:37,166 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 09:57:37,168 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 09:57:37,170 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 09:57:37,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 09:57:37,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 09:57:37,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 09:57:37,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 09:57:37,174 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 09:57:37,175 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 09:57:37,176 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 09:57:37,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 09:57:37,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 09:57:37,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 09:57:37,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 09:57:37,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 09:57:37,186 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 09:57:37,188 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 09:57:37,189 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 09:57:37,189 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 09:57:37,190 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 09:57:37,191 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 09:57:37,192 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 09:57:37,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 09:57:37,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 09:57:37,195 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 09:57:37,195 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 09:57:37,196 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 09:57:37,196 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 09:57:37,197 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 09:57:37,198 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 09:57:37,198 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-20 09:57:37,211 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 09:57:37,211 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 09:57:37,212 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 09:57:37,212 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 09:57:37,213 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 09:57:37,213 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 09:57:37,213 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 09:57:37,213 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 09:57:37,213 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 09:57:37,214 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 09:57:37,214 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 09:57:37,214 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 09:57:37,214 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 09:57:37,214 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 09:57:37,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 09:57:37,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 09:57:37,216 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 09:57:37,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 09:57:37,216 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 09:57:37,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 09:57:37,216 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 09:57:37,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 09:57:37,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 09:57:37,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 09:57:37,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 09:57:37,217 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 09:57:37,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 09:57:37,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 09:57:37,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 09:57:37,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 09:57:37,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 09:57:37,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:37,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 09:57:37,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 09:57:37,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 09:57:37,219 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 09:57:37,219 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 09:57:37,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 09:57:37,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 09:57:37,220 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 09:57:37,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 09:57:37,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 09:57:37,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 09:57:37,266 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 09:57:37,267 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 09:57:37,268 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-20 09:57:37,268 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-20 09:57:37,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 09:57:37,313 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 09:57:37,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:37,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 09:57:37,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 09:57:37,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,350 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-20 09:57:37,351 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-20 09:57:37,351 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-20 09:57:37,369 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:37,370 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 09:57:37,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 09:57:37,370 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 09:57:37,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... [2019-01-20 09:57:37,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 09:57:37,397 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 09:57:37,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 09:57:37,398 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 09:57:37,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-20 09:57:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-20 09:57:37,474 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-20 09:57:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-20 09:57:37,726 INFO L278 CfgBuilder]: Using library mode [2019-01-20 09:57:37,727 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-20 09:57:37,728 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:37 BoogieIcfgContainer [2019-01-20 09:57:37,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 09:57:37,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 09:57:37,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 09:57:37,732 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 09:57:37,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:37" (1/2) ... [2019-01-20 09:57:37,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cae68f0 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:37, skipping insertion in model container [2019-01-20 09:57:37,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:37" (2/2) ... [2019-01-20 09:57:37,736 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-20 09:57:37,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 09:57:37,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-20 09:57:37,772 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-20 09:57:37,805 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 09:57:37,805 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 09:57:37,805 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 09:57:37,805 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 09:57:37,806 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 09:57:37,806 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 09:57:37,806 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 09:57:37,806 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 09:57:37,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-20 09:57:37,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 09:57:37,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:37,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 09:57:37,832 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:37,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:37,838 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-20 09:57:37,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:37,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:37,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,135 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-20 09:57:38,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:38,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 09:57:38,139 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:38,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 09:57:38,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 09:57:38,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 09:57:38,163 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-20 09:57:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,300 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-20 09:57:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 09:57:38,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 09:57:38,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,315 INFO L225 Difference]: With dead ends: 20 [2019-01-20 09:57:38,316 INFO L226 Difference]: Without dead ends: 10 [2019-01-20 09:57:38,319 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-20 09:57:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-20 09:57:38,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-20 09:57:38,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 09:57:38,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-20 09:57:38,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-20 09:57:38,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,353 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-20 09:57:38,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 09:57:38,354 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-20 09:57:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 09:57:38,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 09:57:38,355 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,355 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-20 09:57:38,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,538 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-20 09:57:38,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:38,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 09:57:38,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:38,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 09:57:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 09:57:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 09:57:38,542 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-20 09:57:38,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,762 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-20 09:57:38,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 09:57:38,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-20 09:57:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,764 INFO L225 Difference]: With dead ends: 17 [2019-01-20 09:57:38,764 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 09:57:38,766 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-20 09:57:38,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 09:57:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-20 09:57:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 09:57:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-20 09:57:38,771 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-20 09:57:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,771 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-20 09:57:38,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 09:57:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-20 09:57:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 09:57:38,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,772 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-20 09:57:38,773 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:38,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-20 09:57:38,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,837 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-20 09:57:38,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:38,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 09:57:38,838 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:38,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 09:57:38,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 09:57:38,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:38,839 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-20 09:57:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,883 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-20 09:57:38,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 09:57:38,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-20 09:57:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,885 INFO L225 Difference]: With dead ends: 18 [2019-01-20 09:57:38,885 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 09:57:38,885 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-20 09:57:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 09:57:38,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 09:57:38,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 09:57:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-20 09:57:38,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-20 09:57:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,890 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-20 09:57:38,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 09:57:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-20 09:57:38,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 09:57:38,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,891 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-20 09:57:38,891 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-20 09:57:38,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:38,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,048 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-20 09:57:39,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:39,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-20 09:57:39,052 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-20 09:57:39,088 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:39,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:39,301 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:39,307 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-20 09:57:39,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:39,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:39,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,316 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-20 09:57:39,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:39,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:39,508 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-20 09:57:39,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:39,534 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-20 09:57:39,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:39,718 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-20 09:57:39,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:39,954 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-20 09:57:39,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:39,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 09:57:39,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:39,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 09:57:39,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 09:57:39,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-20 09:57:39,976 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-01-20 09:57:40,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:40,205 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-20 09:57:40,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 09:57:40,205 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-20 09:57:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:40,206 INFO L225 Difference]: With dead ends: 20 [2019-01-20 09:57:40,206 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 09:57:40,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 09:57:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-20 09:57:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 09:57:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-20 09:57:40,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-20 09:57:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:40,212 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-20 09:57:40,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 09:57:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-20 09:57:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-20 09:57:40,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:40,214 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-20 09:57:40,214 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-01-20 09:57:40,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:40,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,358 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-20 09:57:40,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:40,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:40,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:40,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,360 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-20 09:57:40,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:40,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:40,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 09:57:40,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:40,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:40,445 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-20 09:57:40,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:40,531 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-20 09:57:40,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:40,829 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-20 09:57:40,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:40,926 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-20 09:57:40,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:40,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 09:57:40,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:40,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 09:57:40,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 09:57:40,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:40,950 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-01-20 09:57:41,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:41,175 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-20 09:57:41,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 09:57:41,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-20 09:57:41,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:41,179 INFO L225 Difference]: With dead ends: 25 [2019-01-20 09:57:41,179 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 09:57:41,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-20 09:57:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 09:57:41,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-20 09:57:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 09:57:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-20 09:57:41,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-20 09:57:41,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:41,185 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-20 09:57:41,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 09:57:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-20 09:57:41,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 09:57:41,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:41,187 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-20 09:57:41,187 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:41,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:41,188 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-01-20 09:57:41,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:41,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:41,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:41,417 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-20 09:57:41,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:41,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:41,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:41,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 09:57:41,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:41,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:41,460 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:41,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:41,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:41,471 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-20 09:57:41,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:41,481 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-20 09:57:41,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:41,596 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-20 09:57:41,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:41,781 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-20 09:57:41,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:41,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 09:57:41,800 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:41,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 09:57:41,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 09:57:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 09:57:41,803 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-20 09:57:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:41,992 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-20 09:57:41,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 09:57:41,996 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-20 09:57:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:41,997 INFO L225 Difference]: With dead ends: 30 [2019-01-20 09:57:41,997 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 09:57:41,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 09:57:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-20 09:57:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 09:57:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-20 09:57:42,004 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-20 09:57:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:42,004 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-20 09:57:42,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 09:57:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-20 09:57:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-20 09:57:42,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:42,005 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-20 09:57:42,005 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:42,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:42,006 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-01-20 09:57:42,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:42,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:42,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,126 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-20 09:57:42,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:42,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:42,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:42,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,128 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-20 09:57:42,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:42,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:42,182 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-20 09:57:42,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:42,206 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-20 09:57:42,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:42,303 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-20 09:57:42,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:42,388 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-20 09:57:42,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:42,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 09:57:42,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:42,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 09:57:42,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 09:57:42,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:42,408 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-01-20 09:57:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:42,674 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-20 09:57:42,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 09:57:42,676 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-20 09:57:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:42,677 INFO L225 Difference]: With dead ends: 35 [2019-01-20 09:57:42,677 INFO L226 Difference]: Without dead ends: 34 [2019-01-20 09:57:42,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-20 09:57:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-20 09:57:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 09:57:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-20 09:57:42,684 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-20 09:57:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:42,685 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-20 09:57:42,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 09:57:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-20 09:57:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 09:57:42,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:42,686 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-20 09:57:42,686 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:42,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-01-20 09:57:42,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:42,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,835 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-20 09:57:42,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:42,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:42,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:42,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,836 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-20 09:57:42,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:42,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:42,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-20 09:57:42,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:42,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:42,883 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-20 09:57:42,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:42,895 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-20 09:57:42,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:43,080 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-20 09:57:43,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:43,198 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-20 09:57:43,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:43,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-20 09:57:43,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:43,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 09:57:43,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 09:57:43,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-01-20 09:57:43,228 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-20 09:57:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:43,661 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-20 09:57:43,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 09:57:43,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-20 09:57:43,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:43,662 INFO L225 Difference]: With dead ends: 40 [2019-01-20 09:57:43,662 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 09:57:43,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-01-20 09:57:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 09:57:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-20 09:57:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 09:57:43,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-20 09:57:43,669 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-20 09:57:43,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:43,670 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-20 09:57:43,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 09:57:43,670 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-20 09:57:43,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-20 09:57:43,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:43,671 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-20 09:57:43,671 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-01-20 09:57:43,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:43,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:43,981 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-20 09:57:43,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:43,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:43,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:43,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:43,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:43,982 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-20 09:57:43,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:43,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:44,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:44,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:44,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:44,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-20 09:57:44,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:44,045 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-20 09:57:44,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:44,262 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-20 09:57:44,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:44,483 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-20 09:57:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:44,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-20 09:57:44,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:44,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 09:57:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 09:57:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:44,505 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-01-20 09:57:45,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:45,105 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-20 09:57:45,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 09:57:45,105 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-20 09:57:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:45,107 INFO L225 Difference]: With dead ends: 45 [2019-01-20 09:57:45,107 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 09:57:45,108 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-20 09:57:45,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 09:57:45,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-20 09:57:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 09:57:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-20 09:57:45,115 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-20 09:57:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:45,115 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-20 09:57:45,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 09:57:45,116 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-20 09:57:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 09:57:45,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:45,117 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-20 09:57:45,117 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:45,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:45,117 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-01-20 09:57:45,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:45,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:45,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:45,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:45,346 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-20 09:57:45,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:45,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:45,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:45,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:45,347 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-20 09:57:45,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:45,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:45,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:45,419 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-20 09:57:45,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:45,427 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-20 09:57:45,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:45,689 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-20 09:57:45,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:45,961 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-20 09:57:45,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:45,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-20 09:57:45,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:45,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 09:57:45,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 09:57:45,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-01-20 09:57:45,986 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-01-20 09:57:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:46,360 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-20 09:57:46,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 09:57:46,360 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-01-20 09:57:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:46,361 INFO L225 Difference]: With dead ends: 50 [2019-01-20 09:57:46,361 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 09:57:46,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 09:57:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-20 09:57:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 09:57:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-20 09:57:46,371 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-20 09:57:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:46,372 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-20 09:57:46,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 09:57:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-20 09:57:46,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-20 09:57:46,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:46,373 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-20 09:57:46,373 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:46,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:46,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-01-20 09:57:46,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:46,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:46,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:47,126 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-20 09:57:47,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:47,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:47,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:47,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:47,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 09:57:47,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:47,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:47,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-20 09:57:47,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:47,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:47,193 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-20 09:57:47,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:47,202 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-20 09:57:47,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:47,368 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-20 09:57:47,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:47,580 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-20 09:57:47,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:47,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-20 09:57:47,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:47,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 09:57:47,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 09:57:47,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:47,600 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-01-20 09:57:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:47,966 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-20 09:57:47,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 09:57:47,966 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-20 09:57:47,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:47,968 INFO L225 Difference]: With dead ends: 55 [2019-01-20 09:57:47,968 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 09:57:47,969 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-20 09:57:47,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 09:57:47,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-20 09:57:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 09:57:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-20 09:57:47,976 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-20 09:57:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:47,977 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-20 09:57:47,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 09:57:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-20 09:57:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-20 09:57:47,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:47,978 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-20 09:57:47,978 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-01-20 09:57:47,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:48,294 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-20 09:57:48,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:48,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:48,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:48,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,296 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-20 09:57:48,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:48,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:48,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:48,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:48,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:48,362 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-20 09:57:48,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:48,373 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-20 09:57:48,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:48,655 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-20 09:57:48,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:48,853 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-20 09:57:48,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:48,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-20 09:57:48,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:48,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-20 09:57:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-20 09:57:48,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-20 09:57:48,876 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-01-20 09:57:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:49,339 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-20 09:57:49,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 09:57:49,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-01-20 09:57:49,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:49,341 INFO L225 Difference]: With dead ends: 60 [2019-01-20 09:57:49,341 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 09:57:49,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 09:57:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-01-20 09:57:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 09:57:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-20 09:57:49,351 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-20 09:57:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:49,351 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-20 09:57:49,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-20 09:57:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-20 09:57:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 09:57:49,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:49,352 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-20 09:57:49,353 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:49,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:49,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-01-20 09:57:49,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:49,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:49,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:49,763 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-20 09:57:49,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:49,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:49,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:49,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:49,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:49,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 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-20 09:57:49,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:49,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:49,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:49,827 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-20 09:57:49,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:49,839 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-20 09:57:49,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:50,051 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-20 09:57:50,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:50,298 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-20 09:57:50,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:50,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-20 09:57:50,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:50,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 09:57:50,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 09:57:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:50,321 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-01-20 09:57:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:50,836 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-20 09:57:50,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 09:57:50,836 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-20 09:57:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:50,837 INFO L225 Difference]: With dead ends: 65 [2019-01-20 09:57:50,837 INFO L226 Difference]: Without dead ends: 64 [2019-01-20 09:57:50,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:50,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-20 09:57:50,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-20 09:57:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 09:57:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-20 09:57:50,858 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-20 09:57:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:50,859 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-20 09:57:50,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 09:57:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-20 09:57:50,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 09:57:50,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:50,860 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-20 09:57:50,860 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:50,861 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-01-20 09:57:50,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:50,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:51,123 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-20 09:57:51,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:51,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:51,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:51,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:51,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:51,124 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-20 09:57:51,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:51,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:51,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-20 09:57:51,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:51,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:51,196 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-20 09:57:51,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:51,205 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-20 09:57:51,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:51,383 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-20 09:57:51,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:51,668 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-20 09:57:51,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:51,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-20 09:57:51,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:51,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 09:57:51,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 09:57:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-01-20 09:57:51,689 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-01-20 09:57:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:52,218 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-20 09:57:52,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 09:57:52,219 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-01-20 09:57:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:52,220 INFO L225 Difference]: With dead ends: 70 [2019-01-20 09:57:52,220 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 09:57:52,221 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-20 09:57:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 09:57:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-20 09:57:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 09:57:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-20 09:57:52,230 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-20 09:57:52,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:52,231 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-20 09:57:52,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 09:57:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-20 09:57:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-20 09:57:52,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:52,232 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-20 09:57:52,232 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-01-20 09:57:52,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:52,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:52,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:52,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:52,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:52,663 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-20 09:57:52,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:52,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:52,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:52,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:52,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:52,664 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-20 09:57:52,685 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:52,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:52,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:52,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:52,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:52,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-20 09:57:52,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:52,824 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-20 09:57:52,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:53,038 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-20 09:57:53,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:53,559 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-20 09:57:53,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:53,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-20 09:57:53,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:53,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-20 09:57:53,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-20 09:57:53,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:57:53,579 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-01-20 09:57:54,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:54,453 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-20 09:57:54,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 09:57:54,453 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-01-20 09:57:54,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:54,454 INFO L225 Difference]: With dead ends: 75 [2019-01-20 09:57:54,454 INFO L226 Difference]: Without dead ends: 74 [2019-01-20 09:57:54,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:57:54,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-20 09:57:54,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-20 09:57:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 09:57:54,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-20 09:57:54,470 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-20 09:57:54,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:54,470 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-20 09:57:54,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-20 09:57:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-20 09:57:54,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-20 09:57:54,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:54,475 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-20 09:57:54,476 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-01-20 09:57:54,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:54,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:54,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:54,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:54,795 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-20 09:57:54,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:54,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:54,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:54,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,796 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-20 09:57:54,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:54,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:54,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:54,870 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-20 09:57:54,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:54,891 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-20 09:57:54,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:55,272 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-20 09:57:55,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:56,159 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-20 09:57:56,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:56,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-20 09:57:56,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:56,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 09:57:56,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 09:57:56,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-01-20 09:57:56,182 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-01-20 09:57:56,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:56,727 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-20 09:57:56,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 09:57:56,727 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-01-20 09:57:56,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:56,728 INFO L225 Difference]: With dead ends: 80 [2019-01-20 09:57:56,728 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 09:57:56,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:57:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 09:57:56,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-20 09:57:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 09:57:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-20 09:57:56,741 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-20 09:57:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:56,741 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-20 09:57:56,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 09:57:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-20 09:57:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-20 09:57:56,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:56,743 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-20 09:57:56,743 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-01-20 09:57:56,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:56,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:56,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:57,366 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-20 09:57:57,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:57,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:57,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:57,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:57,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:57,367 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-20 09:57:57,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:57,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:57,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-20 09:57:57,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:57,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:57,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-20 09:57:57,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:57,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-20 09:57:57,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:57,728 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-20 09:57:57,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:58,077 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-20 09:57:58,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:58,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-20 09:57:58,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:58,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 09:57:58,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 09:57:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:58,098 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-01-20 09:57:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:58,617 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-20 09:57:58,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 09:57:58,618 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-01-20 09:57:58,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:58,618 INFO L225 Difference]: With dead ends: 85 [2019-01-20 09:57:58,618 INFO L226 Difference]: Without dead ends: 84 [2019-01-20 09:57:58,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 09:57:58,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-20 09:57:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-20 09:57:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 09:57:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-20 09:57:58,634 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-20 09:57:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:58,634 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-20 09:57:58,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 09:57:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-20 09:57:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 09:57:58,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:58,636 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-20 09:57:58,636 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:57:58,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:58,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-01-20 09:57:58,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:58,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,999 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-20 09:57:59,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:59,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:59,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:59,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:59,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:59,000 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-20 09:57:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:59,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:59,062 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:59,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:59,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:59,088 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-20 09:57:59,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:57:59,109 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-20 09:57:59,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:57:59,747 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-20 09:57:59,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:00,133 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-20 09:58:00,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:00,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-20 09:58:00,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:00,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-20 09:58:00,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-20 09:58:00,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-01-20 09:58:00,154 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-01-20 09:58:00,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:00,756 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-20 09:58:00,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 09:58:00,757 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-01-20 09:58:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:00,757 INFO L225 Difference]: With dead ends: 90 [2019-01-20 09:58:00,757 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 09:58:00,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 09:58:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-20 09:58:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-20 09:58:00,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-20 09:58:00,773 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-20 09:58:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:00,773 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-20 09:58:00,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-20 09:58:00,773 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-20 09:58:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-20 09:58:00,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:00,792 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-20 09:58:00,793 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:00,793 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-01-20 09:58:00,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:00,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:00,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:01,170 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-20 09:58:01,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:01,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:01,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:01,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,171 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-20 09:58:01,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:01,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:01,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:01,244 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-20 09:58:01,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:01,254 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-20 09:58:01,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:01,517 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-20 09:58:01,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:01,964 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-20 09:58:01,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:01,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-20 09:58:01,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:01,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 09:58:01,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 09:58:01,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 09:58:01,985 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-01-20 09:58:02,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:02,596 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-20 09:58:02,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 09:58:02,596 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-01-20 09:58:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:02,597 INFO L225 Difference]: With dead ends: 95 [2019-01-20 09:58:02,598 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 09:58:02,600 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-20 09:58:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 09:58:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-20 09:58:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 09:58:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-20 09:58:02,612 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-20 09:58:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:02,613 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-20 09:58:02,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 09:58:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-20 09:58:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-20 09:58:02,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:02,614 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-20 09:58:02,614 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:02,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:02,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-01-20 09:58:02,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:02,944 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-20 09:58:02,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:02,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:02,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:02,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:02,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:02,945 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-20 09:58:02,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:02,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:03,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-20 09:58:03,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:03,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:03,050 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-20 09:58:03,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:03,061 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-20 09:58:03,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:03,451 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-20 09:58:03,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:04,093 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-20 09:58:04,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:04,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-20 09:58:04,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:04,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 09:58:04,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 09:58:04,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-01-20 09:58:04,113 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-01-20 09:58:04,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:04,915 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-20 09:58:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 09:58:04,915 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-01-20 09:58:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:04,916 INFO L225 Difference]: With dead ends: 100 [2019-01-20 09:58:04,916 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 09:58:04,918 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-20 09:58:04,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 09:58:04,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-20 09:58:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 09:58:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-20 09:58:04,928 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-20 09:58:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:04,928 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-20 09:58:04,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 09:58:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-20 09:58:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-20 09:58:04,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:04,929 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-20 09:58:04,929 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:04,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-01-20 09:58:04,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:04,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:04,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:04,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:04,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:05,281 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-20 09:58:05,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:05,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:05,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:05,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:05,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:05,282 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-20 09:58:05,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:05,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:05,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:05,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:05,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:05,362 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-20 09:58:05,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:05,378 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-20 09:58:05,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:05,693 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-20 09:58:05,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:06,327 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-20 09:58:06,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:06,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-20 09:58:06,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:06,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-20 09:58:06,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-20 09:58:06,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:58:06,347 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-01-20 09:58:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:07,022 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-20 09:58:07,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 09:58:07,023 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-01-20 09:58:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:07,024 INFO L225 Difference]: With dead ends: 105 [2019-01-20 09:58:07,024 INFO L226 Difference]: Without dead ends: 104 [2019-01-20 09:58:07,025 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-20 09:58:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-20 09:58:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-01-20 09:58:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 09:58:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-20 09:58:07,035 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-20 09:58:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:07,035 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-20 09:58:07,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-20 09:58:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-20 09:58:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 09:58:07,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:07,036 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-20 09:58:07,036 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-01-20 09:58:07,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:07,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:07,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:07,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:07,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:07,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:07,594 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-20 09:58:07,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:07,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:07,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:07,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:07,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:07,595 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-20 09:58:07,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:07,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:07,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:07,671 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-20 09:58:07,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:07,684 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-20 09:58:07,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:08,068 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-20 09:58:08,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:08,711 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-20 09:58:08,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:08,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-20 09:58:08,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:08,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 09:58:08,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 09:58:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-01-20 09:58:08,733 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-01-20 09:58:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:09,468 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-20 09:58:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 09:58:09,471 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-01-20 09:58:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:09,472 INFO L225 Difference]: With dead ends: 110 [2019-01-20 09:58:09,472 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 09:58:09,473 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-20 09:58:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 09:58:09,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-20 09:58:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-20 09:58:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-20 09:58:09,484 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-20 09:58:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:09,484 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-20 09:58:09,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 09:58:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-20 09:58:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-20 09:58:09,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:09,485 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-20 09:58:09,485 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-01-20 09:58:09,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:09,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:09,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:09,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:10,125 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-20 09:58:10,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:10,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:10,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:10,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:10,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:10,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 09:58:10,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:10,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:10,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-20 09:58:10,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:10,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:10,250 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-20 09:58:10,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:10,263 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-20 09:58:10,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:10,662 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-20 09:58:10,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:11,513 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-20 09:58:11,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:11,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-20 09:58:11,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:11,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 09:58:11,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 09:58:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:58:11,535 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-01-20 09:58:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:12,311 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-20 09:58:12,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 09:58:12,311 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-01-20 09:58:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:12,312 INFO L225 Difference]: With dead ends: 115 [2019-01-20 09:58:12,312 INFO L226 Difference]: Without dead ends: 114 [2019-01-20 09:58:12,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 09:58:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-20 09:58:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-20 09:58:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 09:58:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-20 09:58:12,326 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-20 09:58:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:12,327 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-20 09:58:12,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 09:58:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-20 09:58:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-20 09:58:12,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:12,328 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-20 09:58:12,328 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:12,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:12,328 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-01-20 09:58:12,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:12,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:12,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:12,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:12,754 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-20 09:58:12,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:12,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:12,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:12,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:12,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:12,755 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-20 09:58:12,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:12,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:12,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:12,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:12,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:12,839 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-20 09:58:12,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:12,850 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-20 09:58:12,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:13,263 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-20 09:58:13,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:13,972 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-20 09:58:13,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:13,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-20 09:58:13,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:13,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-20 09:58:13,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-20 09:58:13,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-01-20 09:58:13,992 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-01-20 09:58:14,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:14,942 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-20 09:58:14,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 09:58:14,942 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-01-20 09:58:14,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:14,943 INFO L225 Difference]: With dead ends: 120 [2019-01-20 09:58:14,943 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 09:58:14,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:14,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 09:58:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-01-20 09:58:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-20 09:58:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-20 09:58:14,961 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-20 09:58:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:14,961 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-20 09:58:14,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-20 09:58:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-20 09:58:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-20 09:58:14,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:14,962 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-20 09:58:14,962 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-01-20 09:58:14,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:14,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:14,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:14,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:14,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:15,430 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-20 09:58:15,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:15,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:15,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:15,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:15,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:15,430 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-20 09:58:15,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:15,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:15,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:15,539 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-20 09:58:15,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:15,592 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-20 09:58:15,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:16,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:16,747 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-20 09:58:16,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:16,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-20 09:58:16,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:16,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 09:58:16,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 09:58:16,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:16,768 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-01-20 09:58:17,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:17,829 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-01-20 09:58:17,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 09:58:17,830 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-01-20 09:58:17,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:17,831 INFO L225 Difference]: With dead ends: 125 [2019-01-20 09:58:17,831 INFO L226 Difference]: Without dead ends: 124 [2019-01-20 09:58:17,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-20 09:58:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-01-20 09:58:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-20 09:58:17,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-20 09:58:17,854 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-20 09:58:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:17,854 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-20 09:58:17,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 09:58:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-20 09:58:17,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-20 09:58:17,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:17,855 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-20 09:58:17,856 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-01-20 09:58:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:17,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:17,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:17,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:18,877 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-20 09:58:18,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:18,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:18,878 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:18,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:18,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:18,878 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-20 09:58:18,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:18,887 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:19,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-20 09:58:19,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:19,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:19,039 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-20 09:58:19,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:19,047 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-20 09:58:19,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:19,533 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-20 09:58:19,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:20,654 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-20 09:58:20,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:20,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-20 09:58:20,672 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:20,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 09:58:20,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 09:58:20,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-01-20 09:58:20,674 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-01-20 09:58:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:21,657 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-20 09:58:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 09:58:21,658 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-01-20 09:58:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:21,659 INFO L225 Difference]: With dead ends: 130 [2019-01-20 09:58:21,659 INFO L226 Difference]: Without dead ends: 129 [2019-01-20 09:58:21,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 09:58:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-20 09:58:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-01-20 09:58:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-20 09:58:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-20 09:58:21,675 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-20 09:58:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:21,675 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-20 09:58:21,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 09:58:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-20 09:58:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-20 09:58:21,676 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:21,676 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-20 09:58:21,676 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-01-20 09:58:21,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:21,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:21,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:21,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:21,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:22,507 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-20 09:58:22,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:22,507 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:22,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:22,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,508 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-20 09:58:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:22,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:22,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:22,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:22,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:22,616 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-20 09:58:22,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:22,629 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-20 09:58:22,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:23,117 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-20 09:58:23,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:24,057 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-20 09:58:24,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:24,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-20 09:58:24,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:24,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-20 09:58:24,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-20 09:58:24,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:24,088 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-01-20 09:58:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:25,156 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-20 09:58:25,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 09:58:25,157 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-01-20 09:58:25,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:25,158 INFO L225 Difference]: With dead ends: 135 [2019-01-20 09:58:25,158 INFO L226 Difference]: Without dead ends: 134 [2019-01-20 09:58:25,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 09:58:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-20 09:58:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-01-20 09:58:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-20 09:58:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-20 09:58:25,180 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-20 09:58:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:25,181 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-20 09:58:25,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-20 09:58:25,181 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-20 09:58:25,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-20 09:58:25,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:25,182 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-20 09:58:25,182 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:25,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:25,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-01-20 09:58:25,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:25,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:25,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:25,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:25,798 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-20 09:58:25,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:25,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:25,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:25,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,799 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-20 09:58:25,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:25,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:25,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:25,908 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-20 09:58:25,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:25,997 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-20 09:58:25,997 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:27,413 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-20 09:58:27,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:28,432 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-20 09:58:28,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:28,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-20 09:58:28,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:28,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-20 09:58:28,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-20 09:58:28,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-01-20 09:58:28,452 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-01-20 09:58:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:29,542 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-20 09:58:29,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 09:58:29,542 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-01-20 09:58:29,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:29,543 INFO L225 Difference]: With dead ends: 140 [2019-01-20 09:58:29,543 INFO L226 Difference]: Without dead ends: 139 [2019-01-20 09:58:29,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:58:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-20 09:58:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-01-20 09:58:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-20 09:58:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-20 09:58:29,568 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-20 09:58:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:29,569 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-20 09:58:29,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-20 09:58:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-20 09:58:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-20 09:58:29,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:29,570 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-20 09:58:29,570 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:29,570 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-01-20 09:58:29,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:29,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:29,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:29,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:30,215 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-20 09:58:30,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:30,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:30,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:30,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:30,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:30,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 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-20 09:58:30,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:30,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:30,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-20 09:58:30,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:30,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:30,393 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-20 09:58:30,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:30,488 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-20 09:58:30,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:31,061 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-20 09:58:31,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:32,259 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-20 09:58:32,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:32,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-20 09:58:32,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:32,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 09:58:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 09:58:32,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:32,280 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-01-20 09:58:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:33,374 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-01-20 09:58:33,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 09:58:33,374 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-01-20 09:58:33,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:33,375 INFO L225 Difference]: With dead ends: 145 [2019-01-20 09:58:33,375 INFO L226 Difference]: Without dead ends: 144 [2019-01-20 09:58:33,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 09:58:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-20 09:58:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-01-20 09:58:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-20 09:58:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-20 09:58:33,396 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-20 09:58:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:33,396 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-20 09:58:33,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 09:58:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-20 09:58:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-20 09:58:33,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:33,397 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-20 09:58:33,397 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-01-20 09:58:33,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:33,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:33,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:33,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:33,399 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:34,065 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-20 09:58:34,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:34,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:34,065 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:34,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:34,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:34,066 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-20 09:58:34,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:34,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:34,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:34,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:34,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:34,174 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-20 09:58:34,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:34,183 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-20 09:58:34,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:34,936 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-20 09:58:34,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:36,362 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-20 09:58:36,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:36,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-20 09:58:36,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:36,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-20 09:58:36,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-20 09:58:36,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-01-20 09:58:36,382 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-01-20 09:58:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:37,599 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-20 09:58:37,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 09:58:37,600 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-01-20 09:58:37,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:37,601 INFO L225 Difference]: With dead ends: 150 [2019-01-20 09:58:37,601 INFO L226 Difference]: Without dead ends: 149 [2019-01-20 09:58:37,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:58:37,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-20 09:58:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-20 09:58:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-20 09:58:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-20 09:58:37,620 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-20 09:58:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:37,620 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-20 09:58:37,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-20 09:58:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-20 09:58:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-20 09:58:37,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:37,621 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-20 09:58:37,621 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:37,621 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-01-20 09:58:37,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:37,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:37,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:37,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:38,290 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-20 09:58:38,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:38,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:38,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:38,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:38,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:38,291 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-20 09:58:38,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:38,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:38,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:38,409 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-20 09:58:38,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:38,417 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-20 09:58:38,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:39,043 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-20 09:58:39,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:40,276 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-20 09:58:40,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:40,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-20 09:58:40,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:40,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-20 09:58:40,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-20 09:58:40,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:40,298 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-01-20 09:58:41,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:41,617 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-20 09:58:41,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 09:58:41,618 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-01-20 09:58:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:41,619 INFO L225 Difference]: With dead ends: 155 [2019-01-20 09:58:41,619 INFO L226 Difference]: Without dead ends: 154 [2019-01-20 09:58:41,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:58:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-20 09:58:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-01-20 09:58:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-20 09:58:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-20 09:58:41,639 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-20 09:58:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:41,639 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-20 09:58:41,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-20 09:58:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-20 09:58:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-20 09:58:41,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:41,640 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-20 09:58:41,640 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:41,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:41,641 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-01-20 09:58:41,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:41,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:42,661 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-20 09:58:42,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:42,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:42,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:42,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:42,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:42,662 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-20 09:58:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:42,673 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:42,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-20 09:58:42,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:42,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:42,843 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-20 09:58:42,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:42,853 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-20 09:58:42,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:43,709 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-20 09:58:43,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:44,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-20 09:58:44,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:44,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-20 09:58:44,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:44,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 09:58:44,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 09:58:44,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-01-20 09:58:44,987 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-01-20 09:58:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:46,383 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-01-20 09:58:46,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 09:58:46,383 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-01-20 09:58:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:46,384 INFO L225 Difference]: With dead ends: 160 [2019-01-20 09:58:46,385 INFO L226 Difference]: Without dead ends: 159 [2019-01-20 09:58:46,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 09:58:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-20 09:58:46,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-01-20 09:58:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-20 09:58:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-20 09:58:46,411 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-20 09:58:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:46,411 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-20 09:58:46,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 09:58:46,411 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-20 09:58:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-20 09:58:46,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:46,412 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-20 09:58:46,413 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:46,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:46,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-01-20 09:58:46,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:46,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:46,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:46,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:47,470 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-20 09:58:47,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:47,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:47,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:47,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:47,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:47,471 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-20 09:58:47,479 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:47,479 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:47,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:47,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:47,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:47,581 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-20 09:58:47,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:47,590 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-20 09:58:47,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:48,294 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-20 09:58:48,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:49,918 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-20 09:58:49,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:49,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-20 09:58:49,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:49,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-20 09:58:49,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-20 09:58:49,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:49,939 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-01-20 09:58:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:51,497 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-20 09:58:51,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 09:58:51,498 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-01-20 09:58:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:51,499 INFO L225 Difference]: With dead ends: 165 [2019-01-20 09:58:51,499 INFO L226 Difference]: Without dead ends: 164 [2019-01-20 09:58:51,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 09:58:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-20 09:58:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-20 09:58:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-20 09:58:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-20 09:58:51,523 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-01-20 09:58:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:51,524 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-20 09:58:51,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-20 09:58:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-20 09:58:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-20 09:58:51,525 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:51,525 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-01-20 09:58:51,525 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:51,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-01-20 09:58:51,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:51,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:51,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:51,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:52,325 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-20 09:58:52,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:52,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:52,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:52,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:52,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:52,326 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-20 09:58:52,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:52,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:52,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:52,435 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-20 09:58:52,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:52,453 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-20 09:58:52,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:53,289 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-20 09:58:53,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:54,742 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-20 09:58:54,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:54,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-20 09:58:54,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:54,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-20 09:58:54,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-20 09:58:54,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-01-20 09:58:54,763 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-01-20 09:58:55,471 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 09:58:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:56,806 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-01-20 09:58:56,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 09:58:56,807 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-01-20 09:58:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:56,808 INFO L225 Difference]: With dead ends: 170 [2019-01-20 09:58:56,808 INFO L226 Difference]: Without dead ends: 169 [2019-01-20 09:58:56,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 09:58:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-20 09:58:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-01-20 09:58:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-20 09:58:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-20 09:58:56,834 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-01-20 09:58:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:56,834 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-20 09:58:56,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-20 09:58:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-20 09:58:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-20 09:58:56,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:56,835 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-01-20 09:58:56,836 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:58:56,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-01-20 09:58:56,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:56,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:56,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:56,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:57,575 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-20 09:58:57,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:57,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:57,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:57,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:57,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:57,575 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-20 09:58:57,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:57,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:57,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-20 09:58:57,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:57,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:57,792 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-20 09:58:57,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:58:57,800 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-20 09:58:57,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:58:58,748 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-20 09:58:58,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:01,033 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-20 09:59:01,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:01,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-20 09:59:01,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:01,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 09:59:01,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 09:59:01,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:59:01,054 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-01-20 09:59:02,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:02,519 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-20 09:59:02,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 09:59:02,520 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-01-20 09:59:02,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:02,521 INFO L225 Difference]: With dead ends: 175 [2019-01-20 09:59:02,521 INFO L226 Difference]: Without dead ends: 174 [2019-01-20 09:59:02,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 09:59:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-20 09:59:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-01-20 09:59:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-20 09:59:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-01-20 09:59:02,556 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-01-20 09:59:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:02,557 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-01-20 09:59:02,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 09:59:02,557 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-01-20 09:59:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-20 09:59:02,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:02,558 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-01-20 09:59:02,558 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:02,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:02,558 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-01-20 09:59:02,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:02,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:02,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:02,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:03,835 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-20 09:59:03,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:03,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:03,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:03,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:03,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:03,836 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-20 09:59:03,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:03,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:03,965 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:03,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:03,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:03,974 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-20 09:59:03,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:03,986 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-20 09:59:03,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:04,832 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-20 09:59:04,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:06,717 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-20 09:59:06,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:06,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-20 09:59:06,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:06,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-20 09:59:06,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-20 09:59:06,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-01-20 09:59:06,738 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-01-20 09:59:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:08,499 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-20 09:59:08,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 09:59:08,499 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-01-20 09:59:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:08,500 INFO L225 Difference]: With dead ends: 180 [2019-01-20 09:59:08,500 INFO L226 Difference]: Without dead ends: 179 [2019-01-20 09:59:08,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 09:59:08,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-20 09:59:08,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-01-20 09:59:08,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-20 09:59:08,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-20 09:59:08,530 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-01-20 09:59:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:08,530 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-20 09:59:08,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-20 09:59:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-20 09:59:08,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-20 09:59:08,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:08,531 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-01-20 09:59:08,532 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:08,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-01-20 09:59:08,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:08,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:08,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:08,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:08,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:09,811 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-20 09:59:09,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:09,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:09,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:09,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:09,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:09,812 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-20 09:59:09,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:09,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:09,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:09,973 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-20 09:59:09,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:10,064 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-20 09:59:10,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:10,950 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-20 09:59:10,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:12,874 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-20 09:59:12,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:12,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-20 09:59:12,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:12,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 09:59:12,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 09:59:12,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:59:12,895 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-01-20 09:59:14,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:14,430 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-01-20 09:59:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 09:59:14,430 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-01-20 09:59:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:14,432 INFO L225 Difference]: With dead ends: 185 [2019-01-20 09:59:14,432 INFO L226 Difference]: Without dead ends: 184 [2019-01-20 09:59:14,433 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-20 09:59:14,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-20 09:59:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-01-20 09:59:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-20 09:59:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-20 09:59:14,465 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-01-20 09:59:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:14,466 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-20 09:59:14,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 09:59:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-20 09:59:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-20 09:59:14,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:14,467 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-01-20 09:59:14,467 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-01-20 09:59:14,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:14,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:14,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:14,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:14,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:15,878 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-20 09:59:15,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:15,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:15,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:15,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:15,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:15,879 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-20 09:59:15,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:15,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:16,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-20 09:59:16,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:16,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:16,123 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-20 09:59:16,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:16,221 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-20 09:59:16,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:17,433 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-20 09:59:17,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:19,172 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-20 09:59:19,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:19,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-20 09:59:19,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:19,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 09:59:19,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 09:59:19,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-01-20 09:59:19,193 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-01-20 09:59:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:20,801 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-01-20 09:59:20,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 09:59:20,801 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-01-20 09:59:20,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:20,802 INFO L225 Difference]: With dead ends: 190 [2019-01-20 09:59:20,802 INFO L226 Difference]: Without dead ends: 189 [2019-01-20 09:59:20,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 09:59:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-20 09:59:20,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-01-20 09:59:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-20 09:59:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-01-20 09:59:20,837 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-01-20 09:59:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:20,838 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-01-20 09:59:20,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 09:59:20,838 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-01-20 09:59:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-20 09:59:20,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:20,839 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-01-20 09:59:20,839 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:20,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-01-20 09:59:20,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:20,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:20,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:20,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:20,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:22,019 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-20 09:59:22,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:22,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:22,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:22,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:22,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:22,019 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-20 09:59:22,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:22,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:22,152 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:22,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:22,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:22,177 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-20 09:59:22,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:22,277 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-20 09:59:22,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:23,948 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-20 09:59:23,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:26,000 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-20 09:59:26,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:26,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-20 09:59:26,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:26,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-20 09:59:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-20 09:59:26,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:59:26,021 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-01-20 09:59:27,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:27,954 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-20 09:59:27,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 09:59:27,954 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-01-20 09:59:27,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:27,955 INFO L225 Difference]: With dead ends: 195 [2019-01-20 09:59:27,955 INFO L226 Difference]: Without dead ends: 194 [2019-01-20 09:59:27,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 09:59:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-20 09:59:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-01-20 09:59:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-20 09:59:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-01-20 09:59:27,990 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-01-20 09:59:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:27,990 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-01-20 09:59:27,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-20 09:59:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-01-20 09:59:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-20 09:59:27,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:27,992 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-01-20 09:59:27,992 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-01-20 09:59:27,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:27,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:27,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:29,359 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-20 09:59:29,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:29,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:29,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:29,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:29,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:29,360 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-20 09:59:29,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:29,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:29,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:29,493 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-20 09:59:29,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:29,503 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-20 09:59:29,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:30,522 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-20 09:59:30,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:32,734 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-20 09:59:32,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:32,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-20 09:59:32,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:32,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 09:59:32,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 09:59:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-01-20 09:59:32,754 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-01-20 09:59:33,339 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-20 09:59:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:35,080 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-01-20 09:59:35,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 09:59:35,080 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-01-20 09:59:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:35,081 INFO L225 Difference]: With dead ends: 200 [2019-01-20 09:59:35,081 INFO L226 Difference]: Without dead ends: 199 [2019-01-20 09:59:35,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 09:59:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-20 09:59:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-01-20 09:59:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-20 09:59:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-20 09:59:35,125 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-01-20 09:59:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:35,126 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-20 09:59:35,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 09:59:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-20 09:59:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-20 09:59:35,127 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:35,127 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-01-20 09:59:35,127 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:35,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:35,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-01-20 09:59:35,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:35,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:35,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:35,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:35,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:36,202 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-20 09:59:36,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:36,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:36,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:36,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:36,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:36,203 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-20 09:59:36,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:36,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:36,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-20 09:59:36,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:36,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:36,482 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-20 09:59:36,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:36,492 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-20 09:59:36,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:37,748 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-20 09:59:37,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:39,810 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-20 09:59:39,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:39,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-20 09:59:39,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:39,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 09:59:39,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 09:59:39,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:39,832 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-01-20 09:59:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:41,799 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-01-20 09:59:41,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 09:59:41,799 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-01-20 09:59:41,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:41,800 INFO L225 Difference]: With dead ends: 205 [2019-01-20 09:59:41,800 INFO L226 Difference]: Without dead ends: 204 [2019-01-20 09:59:41,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 09:59:41,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-20 09:59:41,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-01-20 09:59:41,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-20 09:59:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-20 09:59:41,830 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-01-20 09:59:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:41,830 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-20 09:59:41,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 09:59:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-20 09:59:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-20 09:59:41,831 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:41,831 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-01-20 09:59:41,832 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:41,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:41,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-01-20 09:59:41,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:41,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:41,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:41,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:41,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:42,947 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-20 09:59:42,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:42,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:42,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:42,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:42,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:42,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:42,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:42,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:43,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:43,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:43,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:43,095 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-20 09:59:43,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:43,103 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-20 09:59:43,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:44,202 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-20 09:59:44,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:46,365 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-20 09:59:46,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:46,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-20 09:59:46,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:46,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-20 09:59:46,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-20 09:59:46,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-01-20 09:59:46,387 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-01-20 09:59:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:48,312 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-20 09:59:48,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 09:59:48,312 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-01-20 09:59:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:48,313 INFO L225 Difference]: With dead ends: 210 [2019-01-20 09:59:48,314 INFO L226 Difference]: Without dead ends: 209 [2019-01-20 09:59:48,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 09:59:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-20 09:59:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-01-20 09:59:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-20 09:59:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-20 09:59:48,349 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-01-20 09:59:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:48,350 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-20 09:59:48,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-20 09:59:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-20 09:59:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-20 09:59:48,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:48,351 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-01-20 09:59:48,351 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:48,351 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-01-20 09:59:48,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:48,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:48,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:48,352 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:49,771 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-20 09:59:49,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:49,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:49,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:49,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:49,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:49,771 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-20 09:59:49,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:49,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:49,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:49,910 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-20 09:59:49,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:49,921 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-20 09:59:49,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:51,051 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-20 09:59:51,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:53,551 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-20 09:59:53,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:53,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-20 09:59:53,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:53,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 09:59:53,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 09:59:53,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 09:59:53,571 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-01-20 09:59:55,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:55,554 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-20 09:59:55,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 09:59:55,554 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-01-20 09:59:55,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:55,555 INFO L225 Difference]: With dead ends: 215 [2019-01-20 09:59:55,555 INFO L226 Difference]: Without dead ends: 214 [2019-01-20 09:59:55,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 09:59:55,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-20 09:59:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-01-20 09:59:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-20 09:59:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-20 09:59:55,589 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-01-20 09:59:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:55,590 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-20 09:59:55,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 09:59:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-20 09:59:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-20 09:59:55,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:55,591 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-01-20 09:59:55,591 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 09:59:55,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:55,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-01-20 09:59:55,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:55,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:55,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:56,857 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-20 09:59:56,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:56,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:56,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:56,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:56,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:56,858 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-20 09:59:56,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:56,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:57,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-20 09:59:57,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:57,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:57,336 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-20 09:59:57,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 09:59:57,400 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-20 09:59:57,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 09:59:58,586 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-20 09:59:58,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:01,042 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-20 10:00:01,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:01,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-20 10:00:01,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:01,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 10:00:01,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 10:00:01,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-01-20 10:00:01,063 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-01-20 10:00:03,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:03,206 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-01-20 10:00:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 10:00:03,207 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-01-20 10:00:03,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:03,208 INFO L225 Difference]: With dead ends: 220 [2019-01-20 10:00:03,208 INFO L226 Difference]: Without dead ends: 219 [2019-01-20 10:00:03,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:00:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-20 10:00:03,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-01-20 10:00:03,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-20 10:00:03,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-01-20 10:00:03,242 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-01-20 10:00:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:03,242 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-01-20 10:00:03,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 10:00:03,243 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-01-20 10:00:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-20 10:00:03,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:03,243 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-01-20 10:00:03,244 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:00:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-01-20 10:00:03,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:03,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:03,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:03,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:03,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:04,497 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-20 10:00:04,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:04,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:04,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:04,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:04,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:04,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:00:04,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:04,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:04,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:04,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:04,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:04,654 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-20 10:00:04,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:04,660 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-20 10:00:04,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:05,872 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-20 10:00:05,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:08,474 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-20 10:00:08,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:08,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-20 10:00:08,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:08,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-20 10:00:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-20 10:00:08,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:08,496 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-01-20 10:00:10,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:10,622 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-20 10:00:10,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 10:00:10,623 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-01-20 10:00:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:10,624 INFO L225 Difference]: With dead ends: 225 [2019-01-20 10:00:10,624 INFO L226 Difference]: Without dead ends: 224 [2019-01-20 10:00:10,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:00:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-20 10:00:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-01-20 10:00:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:00:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-20 10:00:10,660 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-01-20 10:00:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:10,660 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-20 10:00:10,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-20 10:00:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-20 10:00:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-20 10:00:10,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:10,661 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-01-20 10:00:10,662 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:00:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:10,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-01-20 10:00:10,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:10,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:10,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:11,739 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-20 10:00:11,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:11,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:11,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:11,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:11,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:11,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 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-20 10:00:11,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:11,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:11,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:11,890 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-20 10:00:11,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:11,898 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-20 10:00:11,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:13,478 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-20 10:00:13,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:16,128 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-20 10:00:16,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:16,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-20 10:00:16,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:16,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:00:16,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:00:16,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-01-20 10:00:16,149 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-01-20 10:00:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:18,699 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-01-20 10:00:18,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 10:00:18,700 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-01-20 10:00:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:18,701 INFO L225 Difference]: With dead ends: 230 [2019-01-20 10:00:18,701 INFO L226 Difference]: Without dead ends: 229 [2019-01-20 10:00:18,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:00:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-20 10:00:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-20 10:00:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-20 10:00:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-20 10:00:18,749 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-01-20 10:00:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:18,750 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-20 10:00:18,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:00:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-20 10:00:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-20 10:00:18,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:18,751 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-01-20 10:00:18,751 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:00:18,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:18,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-01-20 10:00:18,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:18,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:18,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:18,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:19,973 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-20 10:00:19,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:19,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:19,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:19,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:19,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:19,974 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-20 10:00:19,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:19,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:20,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-20 10:00:20,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:20,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:20,267 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-20 10:00:20,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:20,278 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-20 10:00:20,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:21,598 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-20 10:00:21,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:24,797 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-20 10:00:24,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:24,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-20 10:00:24,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:24,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:00:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:00:24,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:00:24,819 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-01-20 10:00:27,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:27,202 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-20 10:00:27,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 10:00:27,203 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-01-20 10:00:27,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:27,204 INFO L225 Difference]: With dead ends: 235 [2019-01-20 10:00:27,204 INFO L226 Difference]: Without dead ends: 234 [2019-01-20 10:00:27,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:00:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-20 10:00:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-01-20 10:00:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-20 10:00:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-01-20 10:00:27,263 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-01-20 10:00:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:27,263 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-01-20 10:00:27,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:00:27,263 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-01-20 10:00:27,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-20 10:00:27,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:27,265 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-01-20 10:00:27,265 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:00:27,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:27,265 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-01-20 10:00:27,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:27,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:27,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:27,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:28,751 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-20 10:00:28,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:28,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:28,752 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:28,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:28,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:28,752 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-20 10:00:28,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:28,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:28,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:28,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:28,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:28,935 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-20 10:00:28,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:28,946 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-20 10:00:28,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:30,331 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-20 10:00:30,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:33,355 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-20 10:00:33,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:33,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-20 10:00:33,374 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:33,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-20 10:00:33,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-20 10:00:33,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-01-20 10:00:33,376 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-01-20 10:00:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:35,773 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-20 10:00:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 10:00:35,773 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-01-20 10:00:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:35,775 INFO L225 Difference]: With dead ends: 240 [2019-01-20 10:00:35,775 INFO L226 Difference]: Without dead ends: 239 [2019-01-20 10:00:35,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:00:35,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-20 10:00:35,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-01-20 10:00:35,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-20 10:00:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-01-20 10:00:35,838 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-01-20 10:00:35,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:35,838 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-01-20 10:00:35,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-20 10:00:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-01-20 10:00:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-20 10:00:35,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:35,840 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-01-20 10:00:35,840 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:00:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-01-20 10:00:35,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:35,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:35,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:35,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:35,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:37,118 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-20 10:00:37,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:37,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:37,119 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:37,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:37,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:37,119 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-20 10:00:37,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:37,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:37,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:37,283 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-20 10:00:37,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:37,293 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-20 10:00:37,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:38,875 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-20 10:00:38,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:41,873 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-20 10:00:41,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:41,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-20 10:00:41,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:41,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-20 10:00:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-20 10:00:41,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:00:41,894 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-01-20 10:00:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:44,673 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-01-20 10:00:44,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 10:00:44,680 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-01-20 10:00:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:44,681 INFO L225 Difference]: With dead ends: 245 [2019-01-20 10:00:44,681 INFO L226 Difference]: Without dead ends: 244 [2019-01-20 10:00:44,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:00:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-20 10:00:44,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-01-20 10:00:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-20 10:00:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-20 10:00:44,736 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-01-20 10:00:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:44,737 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-20 10:00:44,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-20 10:00:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-20 10:00:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-20 10:00:44,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:44,738 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-01-20 10:00:44,738 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:00:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-01-20 10:00:44,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:44,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:44,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:44,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:44,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:45,986 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-20 10:00:45,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:45,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:45,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:45,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:45,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:45,987 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-20 10:00:45,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:45,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:46,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-20 10:00:46,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:46,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:46,318 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-20 10:00:46,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:46,326 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-20 10:00:46,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:47,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-20 10:00:47,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:51,247 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-20 10:00:51,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:51,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-20 10:00:51,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:51,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:00:51,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:00:51,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-01-20 10:00:51,268 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-01-20 10:00:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:53,977 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-20 10:00:53,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 10:00:53,977 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-01-20 10:00:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:53,979 INFO L225 Difference]: With dead ends: 250 [2019-01-20 10:00:53,979 INFO L226 Difference]: Without dead ends: 249 [2019-01-20 10:00:53,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:00:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-20 10:00:54,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-01-20 10:00:54,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-20 10:00:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-01-20 10:00:54,034 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-01-20 10:00:54,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:54,034 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-01-20 10:00:54,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:00:54,034 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-01-20 10:00:54,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-20 10:00:54,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:54,035 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-01-20 10:00:54,035 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:00:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-01-20 10:00:54,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:54,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:54,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:54,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:54,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:55,464 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-20 10:00:55,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:55,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:55,464 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:55,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:55,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:55,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 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-20 10:00:55,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:55,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:55,629 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:55,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:55,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:55,642 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-20 10:00:55,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:00:55,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-20 10:00:55,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:00:57,196 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-20 10:00:57,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:00,657 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-20 10:01:00,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:00,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-20 10:01:00,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:00,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-20 10:01:00,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-20 10:01:00,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:01:00,679 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-01-20 10:01:03,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:03,345 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-20 10:01:03,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 10:01:03,345 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-01-20 10:01:03,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:03,347 INFO L225 Difference]: With dead ends: 255 [2019-01-20 10:01:03,347 INFO L226 Difference]: Without dead ends: 254 [2019-01-20 10:01:03,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:01:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-20 10:01:03,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-20 10:01:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-20 10:01:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-01-20 10:01:03,402 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-01-20 10:01:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:03,402 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-01-20 10:01:03,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-20 10:01:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-01-20 10:01:03,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-20 10:01:03,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:03,404 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-01-20 10:01:03,404 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:01:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:03,404 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-01-20 10:01:03,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:03,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:03,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:03,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:03,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:04,996 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-20 10:01:04,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:04,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:04,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:04,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:04,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:04,997 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-20 10:01:05,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:05,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:05,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:05,160 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-20 10:01:05,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:05,169 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-20 10:01:05,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:06,838 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-20 10:01:06,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:10,387 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-20 10:01:10,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:10,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-01-20 10:01:10,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:10,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-20 10:01:10,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-20 10:01:10,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-01-20 10:01:10,410 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-01-20 10:01:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:13,141 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-01-20 10:01:13,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 10:01:13,141 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-01-20 10:01:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:13,143 INFO L225 Difference]: With dead ends: 260 [2019-01-20 10:01:13,143 INFO L226 Difference]: Without dead ends: 259 [2019-01-20 10:01:13,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:01:13,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-20 10:01:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-01-20 10:01:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-20 10:01:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-20 10:01:13,201 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-01-20 10:01:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:13,201 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-20 10:01:13,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-20 10:01:13,201 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-20 10:01:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-20 10:01:13,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:13,203 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-01-20 10:01:13,203 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:01:13,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:13,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-01-20 10:01:13,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:13,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:13,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:13,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:13,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:14,964 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-20 10:01:14,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:14,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:14,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:14,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:14,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:14,965 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-20 10:01:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:14,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:15,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-20 10:01:15,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:15,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:15,321 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-20 10:01:15,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:15,329 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-20 10:01:15,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:16,997 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-20 10:01:16,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:20,724 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-20 10:01:20,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:20,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-20 10:01:20,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:20,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:01:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:01:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:01:20,746 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-01-20 10:01:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:23,494 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-01-20 10:01:23,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 10:01:23,495 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-01-20 10:01:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:23,496 INFO L225 Difference]: With dead ends: 265 [2019-01-20 10:01:23,496 INFO L226 Difference]: Without dead ends: 264 [2019-01-20 10:01:23,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:01:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-20 10:01:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-01-20 10:01:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-20 10:01:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-20 10:01:23,551 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-01-20 10:01:23,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:23,551 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-20 10:01:23,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:01:23,552 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-20 10:01:23,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-20 10:01:23,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:23,553 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-01-20 10:01:23,553 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:01:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:23,554 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-01-20 10:01:23,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:23,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:23,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:23,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:25,319 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-20 10:01:25,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:25,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:25,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:25,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:25,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:25,320 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-20 10:01:25,329 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:25,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:25,498 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:25,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:25,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:25,509 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-20 10:01:25,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:25,520 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-20 10:01:25,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:27,301 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-20 10:01:27,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:31,260 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-20 10:01:31,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:31,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-20 10:01:31,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:31,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-20 10:01:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-20 10:01:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-01-20 10:01:31,282 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-01-20 10:01:34,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:34,168 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-20 10:01:34,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 10:01:34,168 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-01-20 10:01:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:34,169 INFO L225 Difference]: With dead ends: 270 [2019-01-20 10:01:34,169 INFO L226 Difference]: Without dead ends: 269 [2019-01-20 10:01:34,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:01:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-20 10:01:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-01-20 10:01:34,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-20 10:01:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-01-20 10:01:34,227 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-01-20 10:01:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:34,227 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-01-20 10:01:34,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-20 10:01:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-01-20 10:01:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-20 10:01:34,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:34,228 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-01-20 10:01:34,229 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:01:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-01-20 10:01:34,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:34,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:34,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:34,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:35,990 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-20 10:01:35,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:35,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:35,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:35,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:35,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:35,991 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-20 10:01:36,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:36,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:36,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:36,184 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-20 10:01:36,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:36,195 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-20 10:01:36,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:37,975 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-20 10:01:37,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:41,563 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-20 10:01:41,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:41,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-20 10:01:41,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:41,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-20 10:01:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-20 10:01:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:01:41,586 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-01-20 10:01:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:44,517 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-20 10:01:44,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 10:01:44,517 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-01-20 10:01:44,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:44,518 INFO L225 Difference]: With dead ends: 275 [2019-01-20 10:01:44,518 INFO L226 Difference]: Without dead ends: 274 [2019-01-20 10:01:44,520 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-20 10:01:44,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-20 10:01:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-01-20 10:01:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-20 10:01:44,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-20 10:01:44,574 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-01-20 10:01:44,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:44,574 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-20 10:01:44,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-20 10:01:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-20 10:01:44,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-20 10:01:44,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:44,575 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-01-20 10:01:44,576 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:01:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-01-20 10:01:44,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:44,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:44,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:44,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:46,289 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-20 10:01:46,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:46,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:46,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:46,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:46,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:46,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:01:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:46,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:46,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-20 10:01:46,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:46,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:46,682 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-20 10:01:46,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:46,690 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-20 10:01:46,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:48,499 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-20 10:01:48,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:52,250 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-20 10:01:52,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:52,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-20 10:01:52,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:52,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-20 10:01:52,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-20 10:01:52,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-01-20 10:01:52,271 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-01-20 10:01:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:55,499 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-01-20 10:01:55,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 10:01:55,500 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-01-20 10:01:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:55,501 INFO L225 Difference]: With dead ends: 280 [2019-01-20 10:01:55,501 INFO L226 Difference]: Without dead ends: 279 [2019-01-20 10:01:55,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-01-20 10:01:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-20 10:01:55,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-01-20 10:01:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-20 10:01:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-01-20 10:01:55,565 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-01-20 10:01:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:55,566 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-01-20 10:01:55,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-20 10:01:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-01-20 10:01:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-20 10:01:55,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:55,567 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-01-20 10:01:55,567 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:01:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-01-20 10:01:55,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:55,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:55,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:55,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:55,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:57,169 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-20 10:01:57,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:57,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:57,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:57,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:57,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:57,170 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-20 10:01:57,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:57,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:57,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:57,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:57,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:57,362 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-20 10:01:57,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:01:57,377 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-20 10:01:57,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:01:59,269 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-20 10:01:59,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:03,134 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-20 10:02:03,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:03,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-20 10:02:03,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:03,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-20 10:02:03,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-20 10:02:03,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:02:03,155 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-01-20 10:02:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:06,447 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-20 10:02:06,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 10:02:06,447 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-01-20 10:02:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:06,448 INFO L225 Difference]: With dead ends: 285 [2019-01-20 10:02:06,449 INFO L226 Difference]: Without dead ends: 284 [2019-01-20 10:02:06,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-01-20 10:02:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-20 10:02:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-01-20 10:02:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-20 10:02:06,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-20 10:02:06,506 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-01-20 10:02:06,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:06,506 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-20 10:02:06,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-20 10:02:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-20 10:02:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-20 10:02:06,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:06,507 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-01-20 10:02:06,508 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:02:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:06,508 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-01-20 10:02:06,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:06,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:06,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:06,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:08,231 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-20 10:02:08,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:08,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:08,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:08,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:08,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:08,231 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-20 10:02:08,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:08,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:08,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:08,414 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-20 10:02:08,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:08,424 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-20 10:02:08,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:10,382 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-20 10:02:10,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:14,147 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-20 10:02:14,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:14,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-20 10:02:14,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:14,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-20 10:02:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-20 10:02:14,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-01-20 10:02:14,170 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-01-20 10:02:17,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:17,420 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-01-20 10:02:17,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 10:02:17,420 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-01-20 10:02:17,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:17,421 INFO L225 Difference]: With dead ends: 290 [2019-01-20 10:02:17,421 INFO L226 Difference]: Without dead ends: 289 [2019-01-20 10:02:17,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 10:02:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-20 10:02:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-01-20 10:02:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-20 10:02:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-01-20 10:02:17,480 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-01-20 10:02:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:17,480 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-01-20 10:02:17,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-20 10:02:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-01-20 10:02:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-01-20 10:02:17,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:17,481 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-01-20 10:02:17,481 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:02:17,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:17,482 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-01-20 10:02:17,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:17,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:17,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:17,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:17,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:19,424 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-20 10:02:19,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:19,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:19,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:19,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:19,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:19,425 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-20 10:02:19,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:19,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:19,906 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-20 10:02:19,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:19,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:19,919 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-20 10:02:19,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:19,930 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-20 10:02:19,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:22,116 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-20 10:02:22,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:26,113 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-20 10:02:26,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:26,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-20 10:02:26,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:26,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-20 10:02:26,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-20 10:02:26,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:02:26,135 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-01-20 10:02:29,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:29,435 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-20 10:02:29,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 10:02:29,436 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-01-20 10:02:29,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:29,437 INFO L225 Difference]: With dead ends: 295 [2019-01-20 10:02:29,437 INFO L226 Difference]: Without dead ends: 294 [2019-01-20 10:02:29,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-01-20 10:02:29,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-20 10:02:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-01-20 10:02:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-20 10:02:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-01-20 10:02:29,525 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-01-20 10:02:29,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:29,525 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-01-20 10:02:29,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-20 10:02:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-01-20 10:02:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-20 10:02:29,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:29,526 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-01-20 10:02:29,527 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:02:29,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:29,527 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-01-20 10:02:29,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:29,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:29,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:29,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:31,494 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-20 10:02:31,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:31,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:31,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:31,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:31,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:31,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:02:31,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:31,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:31,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:31,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:31,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:31,699 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-20 10:02:31,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:31,709 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-20 10:02:31,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:33,849 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-20 10:02:33,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:37,654 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-20 10:02:37,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:37,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-20 10:02:37,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:37,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-20 10:02:37,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-20 10:02:37,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-01-20 10:02:37,676 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-01-20 10:02:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:41,084 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-01-20 10:02:41,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:02:41,084 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-01-20 10:02:41,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:41,085 INFO L225 Difference]: With dead ends: 300 [2019-01-20 10:02:41,085 INFO L226 Difference]: Without dead ends: 299 [2019-01-20 10:02:41,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-01-20 10:02:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-20 10:02:41,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-01-20 10:02:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-20 10:02:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-01-20 10:02:41,159 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-01-20 10:02:41,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:41,159 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-01-20 10:02:41,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-20 10:02:41,159 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-01-20 10:02:41,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-20 10:02:41,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:41,161 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-01-20 10:02:41,161 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:02:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:41,161 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-01-20 10:02:41,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:41,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:41,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:41,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:41,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:43,047 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-20 10:02:43,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:43,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:43,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:43,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:43,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:43,047 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-20 10:02:43,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:43,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:43,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:43,255 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-20 10:02:43,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:43,265 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-20 10:02:43,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:45,427 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-20 10:02:45,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:49,584 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-20 10:02:49,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:49,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-20 10:02:49,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:49,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-20 10:02:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-20 10:02:49,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:02:49,605 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-01-20 10:02:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:53,297 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-01-20 10:02:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:02:53,298 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-01-20 10:02:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:53,299 INFO L225 Difference]: With dead ends: 305 [2019-01-20 10:02:53,299 INFO L226 Difference]: Without dead ends: 304 [2019-01-20 10:02:53,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-01-20 10:02:53,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-20 10:02:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-01-20 10:02:53,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-20 10:02:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-20 10:02:53,364 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-01-20 10:02:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:53,365 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-20 10:02:53,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-20 10:02:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-20 10:02:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-20 10:02:53,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:53,366 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-01-20 10:02:53,366 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:02:53,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:53,366 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-01-20 10:02:53,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:53,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:53,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:53,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:53,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:55,260 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-20 10:02:55,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:55,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:55,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:55,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:55,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:55,261 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-20 10:02:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:55,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:55,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-20 10:02:55,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:55,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:55,724 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-20 10:02:55,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:02:55,735 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-20 10:02:55,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:02:58,183 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-20 10:02:58,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:02,157 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-20 10:03:02,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:02,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-20 10:03:02,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:02,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-20 10:03:02,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-20 10:03:02,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-01-20 10:03:02,181 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-01-20 10:03:05,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:05,777 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-01-20 10:03:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:03:05,778 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-01-20 10:03:05,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:05,779 INFO L225 Difference]: With dead ends: 310 [2019-01-20 10:03:05,779 INFO L226 Difference]: Without dead ends: 309 [2019-01-20 10:03:05,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-01-20 10:03:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-20 10:03:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-01-20 10:03:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-20 10:03:05,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-01-20 10:03:05,845 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-01-20 10:03:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:05,845 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-01-20 10:03:05,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-20 10:03:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-01-20 10:03:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-20 10:03:05,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:05,847 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-01-20 10:03:05,847 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:03:05,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:05,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-01-20 10:03:05,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:05,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:05,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:05,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:05,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:07,945 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-20 10:03:07,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:07,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:07,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:07,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:07,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:07,946 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-20 10:03:07,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:07,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:08,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:08,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:08,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:08,163 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-20 10:03:08,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:08,172 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-20 10:03:08,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:10,509 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-20 10:03:10,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:14,508 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-20 10:03:14,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:14,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-20 10:03:14,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:14,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-20 10:03:14,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-20 10:03:14,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:03:14,531 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-01-20 10:03:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:18,357 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-20 10:03:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:03:18,357 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-01-20 10:03:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:18,358 INFO L225 Difference]: With dead ends: 315 [2019-01-20 10:03:18,359 INFO L226 Difference]: Without dead ends: 314 [2019-01-20 10:03:18,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-01-20 10:03:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-20 10:03:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-01-20 10:03:18,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-20 10:03:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-01-20 10:03:18,433 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-01-20 10:03:18,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:18,434 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-01-20 10:03:18,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-20 10:03:18,434 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-01-20 10:03:18,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-20 10:03:18,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:18,435 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-01-20 10:03:18,435 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:03:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:18,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-01-20 10:03:18,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:18,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:18,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:18,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:18,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:20,432 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-20 10:03:20,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:20,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:20,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:20,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:20,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:20,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:03:20,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:20,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:20,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:20,639 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-20 10:03:20,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:20,647 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-20 10:03:20,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:23,239 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-20 10:03:23,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:27,238 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-20 10:03:27,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:27,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-20 10:03:27,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:27,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-20 10:03:27,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-20 10:03:27,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-01-20 10:03:27,260 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-01-20 10:03:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:31,081 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-01-20 10:03:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:03:31,081 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-01-20 10:03:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:31,083 INFO L225 Difference]: With dead ends: 320 [2019-01-20 10:03:31,083 INFO L226 Difference]: Without dead ends: 319 [2019-01-20 10:03:31,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-01-20 10:03:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-20 10:03:31,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-01-20 10:03:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-20 10:03:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-01-20 10:03:31,153 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-01-20 10:03:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:31,153 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-01-20 10:03:31,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-20 10:03:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-01-20 10:03:31,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-20 10:03:31,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:31,155 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-01-20 10:03:31,155 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:03:31,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:31,156 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-01-20 10:03:31,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:31,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:31,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:31,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:33,282 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-20 10:03:33,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:33,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:33,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:33,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:33,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:33,282 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-20 10:03:33,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:33,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:33,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-20 10:03:33,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:33,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:33,806 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-20 10:03:33,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:33,820 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-20 10:03:33,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:36,263 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-20 10:03:36,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:40,316 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-20 10:03:40,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-20 10:03:40,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:40,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-20 10:03:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-20 10:03:40,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:03:40,339 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-01-20 10:03:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:44,329 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-01-20 10:03:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:03:44,329 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-01-20 10:03:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:44,330 INFO L225 Difference]: With dead ends: 325 [2019-01-20 10:03:44,330 INFO L226 Difference]: Without dead ends: 324 [2019-01-20 10:03:44,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-01-20 10:03:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-20 10:03:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-01-20 10:03:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-20 10:03:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-20 10:03:44,407 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-01-20 10:03:44,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:44,408 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-20 10:03:44,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-20 10:03:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-20 10:03:44,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-20 10:03:44,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:44,409 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-01-20 10:03:44,409 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:03:44,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:44,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-01-20 10:03:44,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:44,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:44,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:44,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:46,504 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-20 10:03:46,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:46,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:46,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:46,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:46,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:46,505 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-20 10:03:46,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:46,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:46,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:46,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:46,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:46,735 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-20 10:03:46,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:03:46,743 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-20 10:03:46,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:03:49,540 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-20 10:03:49,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:53,768 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-20 10:03:53,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:53,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-20 10:03:53,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:53,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-20 10:03:53,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-20 10:03:53,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-01-20 10:03:53,791 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-01-20 10:03:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:57,858 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-01-20 10:03:57,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:03:57,859 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-01-20 10:03:57,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:57,860 INFO L225 Difference]: With dead ends: 330 [2019-01-20 10:03:57,860 INFO L226 Difference]: Without dead ends: 329 [2019-01-20 10:03:57,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-01-20 10:03:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-01-20 10:03:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-01-20 10:03:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-20 10:03:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-01-20 10:03:57,965 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-01-20 10:03:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:57,966 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-01-20 10:03:57,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-20 10:03:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-01-20 10:03:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-20 10:03:57,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:57,967 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-01-20 10:03:57,967 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:03:57,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-01-20 10:03:57,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:57,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:57,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:57,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:00,087 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-20 10:04:00,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:00,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:00,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:00,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:00,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:00,088 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:04:00,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:00,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:00,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:00,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-20 10:04:00,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:00,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-20 10:04:00,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:02,931 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-20 10:04:02,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:07,029 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-20 10:04:07,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:07,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-20 10:04:07,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:07,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-20 10:04:07,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-20 10:04:07,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:04:07,051 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-01-20 10:04:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:11,353 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-20 10:04:11,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:04:11,353 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-01-20 10:04:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:11,354 INFO L225 Difference]: With dead ends: 335 [2019-01-20 10:04:11,354 INFO L226 Difference]: Without dead ends: 334 [2019-01-20 10:04:11,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-01-20 10:04:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-20 10:04:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-01-20 10:04:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-20 10:04:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-01-20 10:04:11,432 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-01-20 10:04:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:11,433 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-01-20 10:04:11,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-20 10:04:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-01-20 10:04:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-20 10:04:11,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:11,434 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-01-20 10:04:11,434 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:04:11,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:11,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-01-20 10:04:11,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:11,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:11,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:11,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:11,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:13,802 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-20 10:04:13,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:13,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:13,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:13,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:13,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:13,803 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-20 10:04:13,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:13,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:14,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-20 10:04:14,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:14,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:14,342 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-20 10:04:14,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:14,351 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-20 10:04:14,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:17,041 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-20 10:04:17,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:21,143 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-20 10:04:21,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:21,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-20 10:04:21,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:21,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-20 10:04:21,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-20 10:04:21,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-01-20 10:04:21,166 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-01-20 10:04:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:25,509 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-01-20 10:04:25,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:04:25,510 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-01-20 10:04:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:25,511 INFO L225 Difference]: With dead ends: 340 [2019-01-20 10:04:25,511 INFO L226 Difference]: Without dead ends: 339 [2019-01-20 10:04:25,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-01-20 10:04:25,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-20 10:04:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-01-20 10:04:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-20 10:04:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-01-20 10:04:25,588 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-01-20 10:04:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:25,588 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-01-20 10:04:25,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-20 10:04:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-01-20 10:04:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-20 10:04:25,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:25,589 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-01-20 10:04:25,590 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:04:25,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-01-20 10:04:25,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:25,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:25,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:25,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:25,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:27,800 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-20 10:04:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:27,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:27,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:27,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:27,801 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-20 10:04:27,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:27,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:28,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:28,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:28,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:28,040 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-20 10:04:28,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:28,048 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-20 10:04:28,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:31,079 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-20 10:04:31,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:35,224 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-20 10:04:35,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:35,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-20 10:04:35,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:35,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-20 10:04:35,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-20 10:04:35,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:04:35,247 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-01-20 10:04:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:39,678 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-01-20 10:04:39,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:04:39,678 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-01-20 10:04:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:39,679 INFO L225 Difference]: With dead ends: 345 [2019-01-20 10:04:39,679 INFO L226 Difference]: Without dead ends: 344 [2019-01-20 10:04:39,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-01-20 10:04:39,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-20 10:04:39,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-01-20 10:04:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-20 10:04:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-20 10:04:39,777 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-01-20 10:04:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:39,777 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-20 10:04:39,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-20 10:04:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-20 10:04:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-20 10:04:39,778 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:39,778 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-01-20 10:04:39,778 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:04:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-01-20 10:04:39,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:39,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:39,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:39,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:39,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:42,152 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-20 10:04:42,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:42,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:42,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:42,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:42,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:42,152 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-20 10:04:42,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:42,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:42,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:42,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-20 10:04:42,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:42,385 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-20 10:04:42,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:04:45,428 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-20 10:04:45,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:49,689 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-20 10:04:49,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:49,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-20 10:04:49,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:49,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-20 10:04:49,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-20 10:04:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-01-20 10:04:49,713 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-01-20 10:04:54,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:54,223 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-01-20 10:04:54,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:04:54,223 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-01-20 10:04:54,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:54,224 INFO L225 Difference]: With dead ends: 350 [2019-01-20 10:04:54,224 INFO L226 Difference]: Without dead ends: 349 [2019-01-20 10:04:54,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-01-20 10:04:54,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-20 10:04:54,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-01-20 10:04:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-01-20 10:04:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-01-20 10:04:54,310 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-01-20 10:04:54,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:54,310 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-01-20 10:04:54,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-20 10:04:54,310 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-01-20 10:04:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-20 10:04:54,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:54,311 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-01-20 10:04:54,312 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:04:54,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:54,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-01-20 10:04:54,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:54,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:54,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:56,591 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-20 10:04:56,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:56,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:56,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:56,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:56,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:56,592 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-20 10:04:56,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:56,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:57,150 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-20 10:04:57,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:57,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:57,167 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-20 10:04:57,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:04:57,176 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-20 10:04:57,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:00,263 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-20 10:05:00,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:04,328 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-20 10:05:04,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:04,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-20 10:05:04,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:04,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-20 10:05:04,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-20 10:05:04,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:05:04,351 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-01-20 10:05:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:09,011 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-20 10:05:09,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:05:09,011 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-01-20 10:05:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:09,012 INFO L225 Difference]: With dead ends: 355 [2019-01-20 10:05:09,012 INFO L226 Difference]: Without dead ends: 354 [2019-01-20 10:05:09,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-01-20 10:05:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-20 10:05:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-01-20 10:05:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-20 10:05:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-01-20 10:05:09,103 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-01-20 10:05:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:09,104 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-01-20 10:05:09,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-20 10:05:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-01-20 10:05:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-20 10:05:09,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:09,105 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-01-20 10:05:09,105 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:05:09,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-01-20 10:05:09,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:09,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:09,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:11,665 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-20 10:05:11,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:11,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:11,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:11,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:11,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:11,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 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-20 10:05:11,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:11,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:11,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:11,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:11,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:11,925 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-20 10:05:11,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,012 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-20 10:05:12,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:15,237 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-20 10:05:15,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:19,524 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-20 10:05:19,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:19,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-20 10:05:19,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:19,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-20 10:05:19,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-20 10:05:19,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-01-20 10:05:19,547 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-01-20 10:05:24,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:24,385 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-01-20 10:05:24,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:05:24,386 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-01-20 10:05:24,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:24,387 INFO L225 Difference]: With dead ends: 360 [2019-01-20 10:05:24,387 INFO L226 Difference]: Without dead ends: 359 [2019-01-20 10:05:24,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-01-20 10:05:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-20 10:05:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-01-20 10:05:24,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-20 10:05:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-01-20 10:05:24,480 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-01-20 10:05:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:24,480 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-01-20 10:05:24,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-20 10:05:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-01-20 10:05:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-20 10:05:24,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:24,482 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-01-20 10:05:24,482 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:05:24,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:24,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-01-20 10:05:24,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:24,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:24,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:24,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:24,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:27,181 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-20 10:05:27,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:27,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:27,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:27,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:27,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:27,181 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-20 10:05:27,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:27,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:27,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:27,421 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-20 10:05:27,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:27,429 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-20 10:05:27,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:30,802 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-20 10:05:30,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:34,938 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-20 10:05:34,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:34,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-20 10:05:34,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:34,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-20 10:05:34,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-20 10:05:34,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:05:34,961 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-01-20 10:05:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:39,791 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-01-20 10:05:39,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:05:39,791 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-01-20 10:05:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:39,793 INFO L225 Difference]: With dead ends: 365 [2019-01-20 10:05:39,793 INFO L226 Difference]: Without dead ends: 364 [2019-01-20 10:05:39,795 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-20 10:05:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-20 10:05:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-01-20 10:05:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-20 10:05:39,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-20 10:05:39,888 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-01-20 10:05:39,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:39,889 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-20 10:05:39,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-20 10:05:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-20 10:05:39,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-20 10:05:39,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:39,890 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-01-20 10:05:39,890 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:05:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:39,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-01-20 10:05:39,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:39,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:39,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:39,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:42,732 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-20 10:05:42,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:42,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:42,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:42,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:42,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:42,732 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-20 10:05:42,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:42,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:43,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-20 10:05:43,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:43,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:43,365 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-20 10:05:43,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:43,375 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-20 10:05:43,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:05:46,713 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-20 10:05:46,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:51,125 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-20 10:05:51,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:51,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-20 10:05:51,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:51,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-20 10:05:51,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-20 10:05:51,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-01-20 10:05:51,148 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-01-20 10:05:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:56,222 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-01-20 10:05:56,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:05:56,223 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-01-20 10:05:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:56,224 INFO L225 Difference]: With dead ends: 370 [2019-01-20 10:05:56,224 INFO L226 Difference]: Without dead ends: 369 [2019-01-20 10:05:56,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-01-20 10:05:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-20 10:05:56,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-01-20 10:05:56,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-20 10:05:56,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-01-20 10:05:56,323 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-01-20 10:05:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:56,323 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-01-20 10:05:56,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-20 10:05:56,323 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-01-20 10:05:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-01-20 10:05:56,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:56,325 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-01-20 10:05:56,325 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:05:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:56,325 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-01-20 10:05:56,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:56,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:56,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:56,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:58,960 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-20 10:05:58,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:58,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:58,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:58,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:58,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:58,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 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-20 10:05:58,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:58,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:59,241 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:59,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:59,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:59,256 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-20 10:05:59,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:59,268 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-20 10:05:59,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:06:02,668 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-20 10:06:02,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:07,042 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-20 10:06:07,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:07,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-20 10:06:07,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:07,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-20 10:06:07,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-20 10:06:07,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:06:07,065 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-01-20 10:06:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:12,185 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-20 10:06:12,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:06:12,186 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-01-20 10:06:12,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:12,187 INFO L225 Difference]: With dead ends: 375 [2019-01-20 10:06:12,187 INFO L226 Difference]: Without dead ends: 374 [2019-01-20 10:06:12,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-01-20 10:06:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-20 10:06:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-01-20 10:06:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-01-20 10:06:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-01-20 10:06:12,289 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-01-20 10:06:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:12,289 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-01-20 10:06:12,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-20 10:06:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-01-20 10:06:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-20 10:06:12,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:12,291 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-01-20 10:06:12,291 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:06:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-01-20 10:06:12,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:12,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:12,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:14,949 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-20 10:06:14,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:14,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:14,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:14,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:14,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:14,950 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-20 10:06:14,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:14,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:15,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:15,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-20 10:06:15,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:15,208 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-20 10:06:15,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:06:18,847 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-20 10:06:18,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:23,217 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-20 10:06:23,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:23,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-20 10:06:23,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:23,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-20 10:06:23,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-20 10:06:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-01-20 10:06:23,240 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-01-20 10:06:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:28,679 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-01-20 10:06:28,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-20 10:06:28,679 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-01-20 10:06:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:28,681 INFO L225 Difference]: With dead ends: 380 [2019-01-20 10:06:28,681 INFO L226 Difference]: Without dead ends: 379 [2019-01-20 10:06:28,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-01-20 10:06:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-20 10:06:28,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-01-20 10:06:28,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-20 10:06:28,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-01-20 10:06:28,783 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-01-20 10:06:28,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:28,783 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-01-20 10:06:28,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-20 10:06:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-01-20 10:06:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-20 10:06:28,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:28,785 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-01-20 10:06:28,785 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:06:28,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:28,785 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-01-20 10:06:28,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:28,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:28,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:28,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:28,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:31,621 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-20 10:06:31,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:31,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:31,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:31,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:31,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:31,622 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-20 10:06:31,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:31,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:32,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-20 10:06:32,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:32,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:32,296 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-20 10:06:32,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,307 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-20 10:06:32,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:06:35,682 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-20 10:06:35,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:40,077 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-20 10:06:40,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:40,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-20 10:06:40,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:40,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-20 10:06:40,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-20 10:06:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:06:40,100 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-01-20 10:06:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:45,336 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-01-20 10:06:45,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:06:45,337 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-01-20 10:06:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:45,338 INFO L225 Difference]: With dead ends: 385 [2019-01-20 10:06:45,338 INFO L226 Difference]: Without dead ends: 384 [2019-01-20 10:06:45,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-01-20 10:06:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-01-20 10:06:45,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-01-20 10:06:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-20 10:06:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-20 10:06:45,445 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-01-20 10:06:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:45,446 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-20 10:06:45,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-20 10:06:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-20 10:06:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-20 10:06:45,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:45,447 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-01-20 10:06:45,447 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:06:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-01-20 10:06:45,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:45,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:45,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:45,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:45,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:48,587 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-20 10:06:48,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:48,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:48,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:48,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:48,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:48,588 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-20 10:06:48,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:48,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:48,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:48,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:48,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:48,877 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-20 10:06:48,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,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-20 10:06:48,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:06:52,397 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-20 10:06:52,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:56,584 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-20 10:06:56,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:56,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-20 10:06:56,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:56,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-20 10:06:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-20 10:06:56,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-01-20 10:06:56,606 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-01-20 10:07:02,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:02,378 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-01-20 10:07:02,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:07:02,378 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-01-20 10:07:02,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:02,379 INFO L225 Difference]: With dead ends: 390 [2019-01-20 10:07:02,380 INFO L226 Difference]: Without dead ends: 389 [2019-01-20 10:07:02,382 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-20 10:07:02,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-01-20 10:07:02,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-01-20 10:07:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-20 10:07:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-01-20 10:07:02,490 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-01-20 10:07:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:02,491 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-01-20 10:07:02,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-20 10:07:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-01-20 10:07:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-20 10:07:02,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:02,492 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-01-20 10:07:02,492 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:07:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-01-20 10:07:02,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:02,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:02,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:02,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:05,496 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-20 10:07:05,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:05,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:05,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:05,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:05,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:05,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:07:05,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:05,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:05,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:05,746 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-20 10:07:05,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:05,761 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-20 10:07:05,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:07:09,522 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-20 10:07:09,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:14,050 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-20 10:07:14,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:14,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-20 10:07:14,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:14,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-20 10:07:14,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-20 10:07:14,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:07:14,075 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-01-20 10:07:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:19,811 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-20 10:07:19,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:07:19,812 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-01-20 10:07:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:19,813 INFO L225 Difference]: With dead ends: 395 [2019-01-20 10:07:19,813 INFO L226 Difference]: Without dead ends: 394 [2019-01-20 10:07:19,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-01-20 10:07:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-20 10:07:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-01-20 10:07:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-20 10:07:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-01-20 10:07:19,926 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-01-20 10:07:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:19,926 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-01-20 10:07:19,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-20 10:07:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-01-20 10:07:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-01-20 10:07:19,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:19,928 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-01-20 10:07:19,928 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:07:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-01-20 10:07:19,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:19,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:19,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:23,064 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-20 10:07:23,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:23,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:23,064 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:23,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:23,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:23,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:07:23,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:23,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:23,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-20 10:07:23,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:23,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:23,788 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-20 10:07:23,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:23,802 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-20 10:07:23,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:07:27,463 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-20 10:07:27,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:31,886 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-20 10:07:31,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:31,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-20 10:07:31,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:31,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-20 10:07:31,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-20 10:07:31,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-01-20 10:07:31,910 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-01-20 10:07:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:37,843 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-01-20 10:07:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-20 10:07:37,843 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-01-20 10:07:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:37,845 INFO L225 Difference]: With dead ends: 400 [2019-01-20 10:07:37,845 INFO L226 Difference]: Without dead ends: 399 [2019-01-20 10:07:37,846 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-20 10:07:37,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-20 10:07:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-01-20 10:07:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-20 10:07:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-01-20 10:07:37,962 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-01-20 10:07:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:37,963 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-01-20 10:07:37,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-20 10:07:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-01-20 10:07:37,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-01-20 10:07:37,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:37,964 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-01-20 10:07:37,964 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:07:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:37,965 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-01-20 10:07:37,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:37,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:37,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:37,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:37,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:41,027 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-20 10:07:41,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:41,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:41,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:41,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:41,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:41,027 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-20 10:07:41,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:41,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:41,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:41,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:41,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:41,314 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-20 10:07:41,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:41,324 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-20 10:07:41,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:07:45,154 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-20 10:07:45,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:49,675 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-20 10:07:49,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:49,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-20 10:07:49,695 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:49,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-20 10:07:49,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-20 10:07:49,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:07:49,699 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-01-20 10:07:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:55,496 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-01-20 10:07:55,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:07:55,496 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-01-20 10:07:55,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:55,498 INFO L225 Difference]: With dead ends: 405 [2019-01-20 10:07:55,498 INFO L226 Difference]: Without dead ends: 404 [2019-01-20 10:07:55,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-01-20 10:07:55,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-01-20 10:07:55,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-01-20 10:07:55,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-20 10:07:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-20 10:07:55,618 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-01-20 10:07:55,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:55,618 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-20 10:07:55,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-20 10:07:55,618 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-20 10:07:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-20 10:07:55,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:55,620 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-01-20 10:07:55,620 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:07:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-01-20 10:07:55,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:55,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:55,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:59,061 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-20 10:07:59,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:59,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:59,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:59,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:59,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:59,061 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-20 10:07:59,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:59,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:59,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:59,324 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-20 10:07:59,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:59,334 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-20 10:07:59,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:08:03,184 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-20 10:08:03,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:07,829 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-20 10:08:07,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:07,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-20 10:08:07,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:07,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-20 10:08:07,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-20 10:08:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-01-20 10:08:07,851 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-01-20 10:08:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:13,971 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-01-20 10:08:13,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-20 10:08:13,971 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-01-20 10:08:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:13,973 INFO L225 Difference]: With dead ends: 410 [2019-01-20 10:08:13,973 INFO L226 Difference]: Without dead ends: 409 [2019-01-20 10:08:13,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-01-20 10:08:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-01-20 10:08:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-01-20 10:08:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-01-20 10:08:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-01-20 10:08:14,096 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-01-20 10:08:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:14,096 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-01-20 10:08:14,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-20 10:08:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-01-20 10:08:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-01-20 10:08:14,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:14,098 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-01-20 10:08:14,098 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:08:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-01-20 10:08:14,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:14,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:14,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:14,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:17,235 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-20 10:08:17,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:17,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:17,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:17,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:17,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:17,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 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-20 10:08:17,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:08:17,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:08:17,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-20 10:08:17,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:18,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:18,008 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-20 10:08:18,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:18,021 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-20 10:08:18,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:08:22,011 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-20 10:08:22,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:26,517 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-20 10:08:26,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:26,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-20 10:08:26,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:26,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-20 10:08:26,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-20 10:08:26,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:08:26,540 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-01-20 10:08:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:32,916 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-01-20 10:08:32,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:08:32,916 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-01-20 10:08:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:32,918 INFO L225 Difference]: With dead ends: 415 [2019-01-20 10:08:32,918 INFO L226 Difference]: Without dead ends: 414 [2019-01-20 10:08:32,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-01-20 10:08:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-20 10:08:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-01-20 10:08:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-01-20 10:08:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-01-20 10:08:33,045 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-01-20 10:08:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:33,045 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-01-20 10:08:33,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-20 10:08:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-01-20 10:08:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-01-20 10:08:33,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:33,047 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-01-20 10:08:33,047 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:08:33,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:33,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-01-20 10:08:33,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:33,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:33,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:33,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:33,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:36,454 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-20 10:08:36,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:36,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:36,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:36,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:36,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:36,455 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-20 10:08:36,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:08:36,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:08:36,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:08:36,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:36,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:36,747 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-20 10:08:36,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:36,758 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-20 10:08:36,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:08:40,940 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-20 10:08:40,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:45,436 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-20 10:08:45,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:45,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-20 10:08:45,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:45,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-20 10:08:45,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-20 10:08:45,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-01-20 10:08:45,459 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-01-20 10:08:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:51,759 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-01-20 10:08:51,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:08:51,759 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-01-20 10:08:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:51,761 INFO L225 Difference]: With dead ends: 420 [2019-01-20 10:08:51,761 INFO L226 Difference]: Without dead ends: 419 [2019-01-20 10:08:51,764 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-20 10:08:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-01-20 10:08:51,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-01-20 10:08:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-01-20 10:08:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-01-20 10:08:51,892 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-01-20 10:08:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:51,892 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-01-20 10:08:51,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-20 10:08:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-01-20 10:08:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-01-20 10:08:51,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:51,894 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-01-20 10:08:51,894 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:08:51,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-01-20 10:08:51,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:51,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:51,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:51,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:51,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:55,370 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-20 10:08:55,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:55,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:55,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:55,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:55,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:55,371 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-20 10:08:55,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:55,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:55,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:55,680 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-20 10:08:55,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:55,689 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-20 10:08:55,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:08:59,743 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-20 10:08:59,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:04,274 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-20 10:09:04,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:04,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-20 10:09:04,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:04,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-20 10:09:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-20 10:09:04,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:09:04,299 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-01-20 10:09:10,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:10,947 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-01-20 10:09:10,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:09:10,947 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-01-20 10:09:10,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:10,949 INFO L225 Difference]: With dead ends: 425 [2019-01-20 10:09:10,949 INFO L226 Difference]: Without dead ends: 424 [2019-01-20 10:09:10,952 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-20 10:09:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-20 10:09:11,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-01-20 10:09:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-20 10:09:11,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-01-20 10:09:11,080 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-01-20 10:09:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:11,081 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-01-20 10:09:11,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-20 10:09:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-01-20 10:09:11,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-20 10:09:11,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:11,083 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-01-20 10:09:11,083 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:09:11,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:11,084 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-01-20 10:09:11,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:11,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:11,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:11,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:11,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:14,523 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-20 10:09:14,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:14,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:14,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:14,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:14,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:14,524 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-20 10:09:14,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:14,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:15,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-20 10:09:15,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:15,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:15,372 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-20 10:09:15,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,386 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-20 10:09:15,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:09:19,616 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-20 10:09:19,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:24,257 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-20 10:09:24,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:24,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-20 10:09:24,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:24,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-20 10:09:24,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-20 10:09:24,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13727, Invalid=21805, Unknown=0, NotChecked=0, Total=35532 [2019-01-20 10:09:24,282 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-01-20 10:09:31,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:31,186 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-01-20 10:09:31,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-20 10:09:31,187 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-01-20 10:09:31,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:31,189 INFO L225 Difference]: With dead ends: 430 [2019-01-20 10:09:31,189 INFO L226 Difference]: Without dead ends: 429 [2019-01-20 10:09:31,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 668 SyntacticMatches, 68 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34468 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=26304, Invalid=48498, Unknown=0, NotChecked=0, Total=74802 [2019-01-20 10:09:31,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-01-20 10:09:31,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-01-20 10:09:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-20 10:09:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-01-20 10:09:31,330 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-01-20 10:09:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:31,330 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-01-20 10:09:31,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-20 10:09:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-01-20 10:09:31,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-01-20 10:09:31,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:31,332 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-01-20 10:09:31,332 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:09:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-01-20 10:09:31,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:31,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:31,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:31,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:31,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:34,790 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-20 10:09:34,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:34,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:34,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:34,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:34,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:34,791 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-20 10:09:34,801 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:34,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:35,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:35,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:35,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:35,087 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-20 10:09:35,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,098 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-20 10:09:35,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:09:39,630 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-20 10:09:39,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:44,307 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-20 10:09:44,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:44,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-20 10:09:44,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:44,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-20 10:09:44,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-20 10:09:44,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13829, Invalid=22081, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:09:44,333 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2019-01-20 10:09:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:51,412 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2019-01-20 10:09:51,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:09:51,412 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2019-01-20 10:09:51,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:51,414 INFO L225 Difference]: With dead ends: 435 [2019-01-20 10:09:51,414 INFO L226 Difference]: Without dead ends: 434 [2019-01-20 10:09:51,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 676 SyntacticMatches, 70 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35139 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=26597, Invalid=49303, Unknown=0, NotChecked=0, Total=75900 [2019-01-20 10:09:51,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-20 10:09:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-01-20 10:09:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-01-20 10:09:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2019-01-20 10:09:51,563 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2019-01-20 10:09:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:51,563 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2019-01-20 10:09:51,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-20 10:09:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2019-01-20 10:09:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-01-20 10:09:51,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:51,565 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2019-01-20 10:09:51,565 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:09:51,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:51,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2019-01-20 10:09:51,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:51,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:51,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:55,075 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-20 10:09:55,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:55,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:55,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:55,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:55,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:55,076 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-20 10:09:55,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:55,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:55,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:55,356 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-20 10:09:55,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:55,367 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-20 10:09:55,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:09:59,992 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-20 10:09:59,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:04,728 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-20 10:10:04,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:04,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-01-20 10:10:04,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:04,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-20 10:10:04,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-20 10:10:04,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13931, Invalid=22359, Unknown=0, NotChecked=0, Total=36290 [2019-01-20 10:10:04,782 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 176 states. [2019-01-20 10:10:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:11,896 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2019-01-20 10:10:11,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-20 10:10:11,897 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 430 [2019-01-20 10:10:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:11,898 INFO L225 Difference]: With dead ends: 440 [2019-01-20 10:10:11,898 INFO L226 Difference]: Without dead ends: 439 [2019-01-20 10:10:11,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 684 SyntacticMatches, 72 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35812 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=26891, Invalid=50115, Unknown=0, NotChecked=0, Total=77006 [2019-01-20 10:10:11,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-01-20 10:10:12,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2019-01-20 10:10:12,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-01-20 10:10:12,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2019-01-20 10:10:12,043 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2019-01-20 10:10:12,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:12,043 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2019-01-20 10:10:12,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-20 10:10:12,043 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2019-01-20 10:10:12,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2019-01-20 10:10:12,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:12,045 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2019-01-20 10:10:12,045 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-20 10:10:12,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:12,045 INFO L82 PathProgramCache]: Analyzing trace with hash 230864771, now seen corresponding path program 86 times [2019-01-20 10:10:12,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:12,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:12,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:12,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:16,022 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-20 10:10:16,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:16,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:16,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:16,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:16,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:16,023 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-20 10:10:16,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:10:16,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:10:16,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-01-20 10:10:16,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:16,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:16,958 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-20 10:10:16,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,970 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-20 10:10:16,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-20 10:10:21,457 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-20 10:10:21,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:26,055 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-20 10:10:26,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:26,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 190 [2019-01-20 10:10:26,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:26,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-01-20 10:10:26,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-01-20 10:10:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14033, Invalid=22639, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:10:26,079 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 178 states.